Error Correcting Codes

  • Christiane Rousseau
  • Yvan Saint-Aubin
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)


Nonzero Element Compact Disc Multiplication Table Irreducible Polynomial Primitive Root 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E.R. Berlekamp, editor.Key Papers in the Development of Coding Theory. IEEE Press, 1974.Google Scholar
  2. [2]
    S. Lang.Undergraduate Algebra. Springer, New York, 2nd edition, 1990.MATHGoogle Scholar
  3. [3]
    R.J. McEliece. The reliability of computer memories.Scientific American, pages 88–95, January 1985.Google Scholar
  4. [4]
    J. Monforte. The digital reproduction of sound.Scientific American, pages 78–84, December 1984.Google Scholar
  5. [5]
    W.W. Peterson. Error-correcting codes.Scientific American, pages 96–108, February 1962.Google Scholar
  6. [6]
    V. Pless.Introduction to the Theory of Error-Correcting Codes. Wiley, New York, 3rd edition, 1999.Google Scholar
  7. [7]
    K.C. Pohlmann.The Compact Disc Handbook. A-R Editions, Madison, WI, 2nd edition, 1992.Google Scholar
  8. [8]
    I.S. Reed and G. Solomon. Polynomial codes over certain finite fields.Journal of the Society for Industrial and Applied Mathematics, 8:300–304, 1960. (This article is also contained in Berlekamp’s survey[1]).MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag New York 2008

Authors and Affiliations

  1. 1.Département de mathématiques et de statistiqueUniversité de MontréalCanada

Personalised recommendations