Advertisement

An overview of recent results in the theory of burst-correcting codes

  • Henk C. A. van Tilborg
Section III Combinatorial And Algebraic Aspects
Part of the Lecture Notes in Computer Science book series (LNCS, volume 388)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Abdel-Ghaffar, K.A.S.,R.J. McEliece, A.M. Odlyzko and H.C.A. van Tilborg, On the existence of optimum cyclic burst-correcting codes, IEEE Trans. Inform. Theory, vol. IT-32, pp. 768–775, Nov. 1986.CrossRefGoogle Scholar
  2. [2]
    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
  3. [3]
    Bahl, L.R. and R.T. Chien, Jr., Multiple-burst-error correction by threshold decoding, Inform. Contr., vol. 15, pp. 397–406, 1969.CrossRefGoogle Scholar
  4. [4]
    Blaum. M., P.G. Farrell and H.C.A. van Tilborg, A class of burst-correcting array codes, IEEE Trans. Inform. Theory, vol. IT-32, pp. 836–838, Nov. 1986.CrossRefGoogle Scholar
  5. [5]
    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
  6. [6]
    Blahut, R.E., Theory and practice of error control codes, Addison Wesley, Reading MA, 1983.Google Scholar
  7. [7]
    Burton, H. O. and E.J. Weldon, Cyclic product codes, IEEE Trans. Inform. Theory, vol. IT-11, pp. 433–439, July, 1965.CrossRefGoogle Scholar
  8. [8]
    Elspas, B. and R.A. Short, A note on optimum burst-error-correcting codes, IRE Trans. Inform. Theory, vol. IT-8, pp. 39–42, Jan. 1962.CrossRefGoogle Scholar
  9. [9]
    MacWilliams, F.J. and N.J.A. Sloane, The theory of error correcting codes, North Holland, Amsterdam, 1977.Google Scholar
  10. [10]
    Peterson, W.W. and E.J. Weldon, Jr., Error-correcting codes, second edition, The MIT Press, Cambidge, 1981.Google Scholar
  11. [11]
    van Lint, J. H., Introduction to coding theory Graduate Texts in Mathematics 86, Springer Verlag, New York, etc., 1982.Google Scholar
  12. [12]
    van Overveld, W. M. C. J., Some constructions of new burst-correcting codes, IEEE Trans. Inform. Theory, vol. IT-33, p. 153, Jan. 1987.CrossRefGoogle Scholar
  13. [13]
    van Overveld, W. M. C. J., Multiple-burst-correcting cyclic product codes, IEEE Trans. Inform. Theory, vol. IT-33, pp. 919–923, Dec. 1987.CrossRefGoogle Scholar
  14. [14]
    Zhang, W. and J.K. Wolf, A class of binary burst error-correcting quasicyclic codes, IEEE Trans. Inform. Theory. vol. IT-34, p. 463–479, May 1988.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Henk C. A. van Tilborg
    • 1
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyEindhoventhe Netherlands

Personalised recommendations