• N. J. A. Sloane
Part of the International Centre for Mechanical Sciences book series (CISM, volume 188)


(1.1.1) Definition An (n,M,d) code is a set of M binary vectors of length n, called codewords, such that any two codewords differ in at least d places. n is called the (block) length of the code, and d is the minimum distance of the code. R = log2 M/n is called the rate of the code, for reasons we shall see in §§2.


Projective Plane Linear Code Weight Enumerator Bell System Technical Journal Goppa Code 
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.


Books on coding theory

  1. [1]
    E.R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968. ( The best book available. Excellent treatment of BCH codes. )Google Scholar
  2. [2]
    J.H. van Lint, Coding Theory, Springer Verlag, Berlin, 1971 — Lecture notes in mathematics, number 201. (Excellent introduction, designed for mathematics students.)Google Scholar
  3. [3]
    W.W. Peterson, Error-Correcting Codes, MIT Press, Cambridge, Mass., 1961. ( A good introduction to the subject for engineers. )Google Scholar
  4. [3a]
    a] W.W. Peterson and E.J. Weldon, Jr., Error-Correcting Codes, Second Edition, MIT Press, Cambridge, Mass., 1972. (Greatly expanded version of [31.)Google Scholar
  5. [4]
    ] F.J. MacWilliams and N.J.A. Sloane, Combinatorial Coding Theory, in preparation. (Recommended!)Google Scholar
  6. [5]
    Shu Lin, An Introduction to Error-Correcting Codes, Prentice-Hall, Englewood Cliffs, New Jersey, 1970. ( Another introduction for engineers. )Google Scholar
  7. [6]
    Chapter 6 of [17]. (A good short introduction to coding theory. Gives a better description of BCH decoding than [11.)Google Scholar
  8. [7]
    S.W. Golomb, editor, Digital Communications with Space Applications, Prentice-Hall, Englewood Cliffs, New Jersey, 1964.Google Scholar
  9. [8]
    H.B. Mann, editor, Error Correcting Codes, Wiley, New York 1968. ([7] and [8] contain a number of interesting papers on coding theory, especially for radar applications.)Google Scholar

Periodicals The first three

  1. [9]
    IEEE (Institute of Electrical and Electronic Engineers) Transactions on Information Theory (abbreviated PGIT)Google Scholar
  2. [10]
    Information and Control (abbreviated IC), andGoogle Scholar
  3. [11]
    Problemy Peredachi Informatsii (Russian, abbreviated PPI), are the main sources for papers on coding theory. Occasional articles on coding theory will be found inGoogle Scholar
  4. [12]
    ] IEE Transactions on Communications (Abbreviated PGCOM) (See in 1971).Google Scholar
  5. [13]
    Discrete Mathematics (abbreviated DM. See e.g., the special issue on coding theory, September 1972.)Google Scholar
  6. [14]
    IBM Journal of Research and Development, (abbreviated IBMJ) (See e.g., the special issue on coding theory, July 1970.)Google Scholar
  7. [15]
    Bell System Technical Journal (abbreviated BSTJ).Google Scholar
  8. [16]
    Journal of Combinatorial Theory, (abbreviated JCT).Google Scholar

Books on Communication Theory

  1. ] R.G. Gallager, Information Theory and Reliable Communication, Wiley, New York, 1969.Google Scholar
  2. [18]
    J.M. Wozencraft and I.M. Jacobs, Principles of Communication Engineering, Wiley, New York, 1965.Google Scholar
  3. [19]
    Toby Berger, Rate Distortion Theory, Prentice-Hall, Englewood Cliffs, New York, 1971.Google Scholar
  4. [20]
    J.J. Stiffler, Theory of Synchronous Communications, Prentice-Hall, 1971. Two other important books are:Google Scholar
  5. [21]
    N. Abramson, Information Theory and Coding, McGraw-Hill, N.Y., 1963. ( A good introduction, very easy to read. )Google Scholar
  6. [22]
    F. Jelinek, Probabilistic Information Theory, McGraw-Hill, N.Y., 1968. ( Very thorough, advanced treatment of information theory. )MATHGoogle Scholar

Other References Cited in 1

  1. [22a]
    Assmus, E.F., Jr., and H.F. Mattson, Jr., (1970), The Algebraic Theory of Codes II, AFCRL Report 71–0013, especially Part I I.Google Scholar
  2. [23]
    l Delsarte, P. (1972), Bounds for Unrestricted Codes, by Linear Programming, PRR 27: 272–289.MATHMathSciNetGoogle Scholar
  3. [24]
    l Gilbert, E.N. (1952), A Comparison of Signalling Alphabets, BSTJ 39: 1253–2156.Google Scholar
  4. [25.
    l Golay, M.J.E. (1949), Notes on Digital Coding, PIEEE 37: 657.Google Scholar
  5. [26]
    Golay, M.J.E. (1954), Binary Coding, PGIT 4: 23–28.MathSciNetGoogle Scholar
  6. [27]
    Goppa, V.D. (1970), A New Class of Linear Error-Correcting Codes, PPI 6 (3): 24–30.MATHMathSciNetGoogle Scholar
  7. [28]
    Goppa, V.D. (1971), Rational Representation of Codes and (L,G) Codes, PPI 7 (3): 41–49.MATHMathSciNetGoogle Scholar
  8. [29]
    Goppa, V.D. (1972), Some Codes Constructed on the Basis of (L,G) Codes, PPI 8 (2): 107–109.MATHMathSciNetGoogle Scholar
  9. [29a]
    Hall, M., Jr. (1967), Combinatorial Theory, Balisdell, Watham, Mass.MATHGoogle Scholar
  10. [30]
    Hamming, R.W. (1950), Error Detecting and Error Correcting Codes, BSTJ 29: 147–160.MathSciNetGoogle Scholar
  11. [30a]
    Hughes, D.R. and F.C. Piper (1973), Projective Planes, Springer, New York.MATHGoogle Scholar
  12. [31]
    Johnson, S.M. (1962), A New Upper Bound for Error-Correcting Codes, PGIT 8: 203–207.MATHGoogle Scholar
  13. [32]
    Johnson, S.M. (1963), Improved Asymptotic Bounds for Error-Correcting Codes, PGIT 9: 198–205.MATHGoogle Scholar
  14. [33]
    Johnson, S.M. (1971), On Upper Bounds for Unrestricted Binary Error-Correcting Codes, PGIT 17: 466–478.MATHGoogle Scholar
  15. [34]
    Johnson, S.M. (1972), Upper Bounds for Constant Weight Error-Correcting Codes, DM 3: 109–124.MATHGoogle Scholar
  16. [35]
    Justesen, J. (1972), A Class of Constructive Asymptotically Good Algebraic Codes, PGIT 18: 652–656.MATHMathSciNetGoogle Scholar
  17. [36]
    Kerdock, A.M. (1972), A Class of Low-rate Nonlinear Binary Codes, IC 20: 182–187.MATHMathSciNetGoogle Scholar
  18. [36a]
    Koshelev, V.N. (1965), Some Properties of Random Group Codes of Large Length, PPI 1: 45–48.Google Scholar
  19. [36b]
    Kozlov, M.V. (1969), The Correcting Capacities of Linear Codes, Soviet Physics — Doklady 14: 413–415.MATHMathSciNetGoogle Scholar
  20. [37]
    MacWilliams, F.J., N.J.A. Sloane, and J.G. Thompson (1973), On The Existence of a Projective Plane of Order 10, JCT 14A: 66–78.MATHMathSciNetGoogle Scholar
  21. [38]
    Mitani, N. (1951), On the Transmission of Numbers in a Sequential Computer, Delivered at the National Convention of the Inst. of Elect. Engineers of Japan, November 1951.Google Scholar
  22. [39]
    Müller, D.E. (1954), Application of Boolean Algebra to Switching Circuit Design and to Error Detection, PGEC 3: 6–12.Google Scholar
  23. [40]
    Mykkeltveit, J. (1972), A Note on Kerdock Codes, JPL Report 32–1526, Vol. 9: 82–83.Google Scholar
  24. [41]
    Mykkeltveit, J., C. Lam and R. J. McEliece (1973), On the Weight Enumerators of Quadratic Residue Codes, JPL Report 32–1526.Google Scholar
  25. [42]
    Nordstrom, A.W. and J.P. Robinson (1967), An Optimum Nonlinear Code, IC 11: 613–616.MATHGoogle Scholar
  26. [42a]
    Pierce, J.N. (1967), Limit Distribution of the Minimum Distance of Random Linear Codes, PGIT 13: 595–599.MATHMathSciNetGoogle Scholar
  27. [43]
    Plotkin, M. (1960), Binary Codes with Specified Minimum Distances, PGIT 6: 445–450.MathSciNetGoogle Scholar
  28. [44]
    Preparata, F.P. (1968), A Class of Optimum Nonlinear Double-ErrorCorrecting Codes, IC 13: 378–400.MATHMathSciNetGoogle Scholar
  29. [45]
    Preparata, F.P. (1968A), Weight and Distances Structure of Nordstrom-Robinson Quadratic Code, IC 12: 466–473 and 13: 172.Google Scholar
  30. [46]
    Reed, I.S. (1954), A Class of Multiple-Error-Correcting Codes and the Decoding Scheme, PGIT 4: 38–49.Google Scholar
  31. [47]
    Shannon, C.E. (1948), A Mathematical Theory of Communication, BSTJ 27: 379–423 and 623–656. Reprinted in A Mathematical Theory of Communication, by C.E. Shannon and W. Weaver, University of Illinois Press, Urbana, Illinois, 1963.Google Scholar
  32. [48]
    Shannon, C.E., R.G. Gallager, and E.R. Berlekamp (1967), Lower Bounds Error Probability for Coding on Discrete Memory Channels, IC 10: 65–103 and 522–552.Google Scholar
  33. [49]
    Varshamov, R.R. (1957), Estimate of the Number of Signals in ErrorCorrccting Codes, Dokl. Akad. Nauk SSSR, 117: 739–741.MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Wien 1975

Authors and Affiliations

  • N. J. A. Sloane
    • 1
  1. 1.Bell LaboratoriesNew JerseyUSA

Personalised recommendations