An overview of recent results in the theory of burst-correcting codes
The number of publications about burst-correcting codes during the last few years suggest a certain revival of this topic. Clearly in all kinds of applications one observes that stored or transmitted data can be corrupted by bursts of errors. The most common solutions to this problem are the method of interleaving or a technique that considers codes over larger fields. These methods are very popular, partly because of their simplicity. Here a survey of other (recent) methods is given, that because of their combinatorial or algebraic structure have better burst-correcting properties and still have low complexity.
Unable to display preview. Download preview PDF.
- Abramson, N.M., Error-correcting codes from linear sequential circuits, presented at the 4th Symp. on Information Theory, London, England, Aug. 29–Sept. 2, 1960.Google Scholar
- Blaum. M., P.G. Farrell and H.C.A. van Tilborg, Multiple burst-correcting array codes, to appear in IEEE Trans. Inform. Theory.Google Scholar
- Blahut, R.E., Theory and practice of error control codes, Addison Wesley, Reading MA, 1983.Google Scholar
- MacWilliams, F.J. and N.J.A. Sloane, The theory of error correcting codes, North Holland, Amsterdam, 1977.Google Scholar
- Peterson, W.W. and E.J. Weldon, Jr., Error-correcting codes, second edition, The MIT Press, Cambidge, 1981.Google Scholar
- van Lint, J. H., Introduction to coding theory Graduate Texts in Mathematics 86, Springer Verlag, New York, etc., 1982.Google Scholar