Fundamentals of Error-Correcting Codes

Preface 1. Basic concepts of linear codes 2. Bounds on size of codes 3. Finite fields 4. Cyclic codes 5. BCH and Reed-Soloman codes 6. Duadic codes 7. Weight distributions 8. Designs 9. Self-dual codes 10. Some favourite self-dual codes 11. Covering radius and cosets 12. Codes over Z4 13. Codes from algebraic geometry 14. Convolutional codes 15. Soft decision and iterative decoding Bibliography Index.

[1]  É. Lucas,et al.  Sur les congruences des nombres eulériens et des coefficients différentiels des fonctions trigonométriques suivant un module premier , 1878 .

[2]  L. Fejes.  Über einen geometrischen Satz , 1940 .

[3]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[4]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[5]  David E. Muller,et al.  Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..

[6]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[7]  S. P. Lloyd.  Binary block coding , 1957 .

[8]  Dwijendra K. Ray-Chaudhuri,et al.  Binary mixture flow with free energy lattice Boltzmann methods , 2022, arXiv.org.

[9]  W. W. Peterson,et al.  Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.

[10]  James H. Griesmer,et al.  A Bound for Error-Correcting Codes , 1960, IBM J. Res. Dev..

[11]  Dwijendra K. Ray-Chaudhuri,et al.  Further Results on Error Correcting Binary Group Codes , 1960, Inf. Control..

[12]  Morris Plotkin,et al.  Binary codes with specified minimum distance , 1960, IRE Trans. Inf. Theory.

[13]  Neal Zierler,et al.  Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect , 1960, Inf. Control..

[14]  N. Zierler,et al.  A Class of Error-Correcting Codes in $p^m $ Symbols , 1961 .

[15]  John E. Meggitt.  Error-correcting codes for correcting bursts of errors , 1961, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[16]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[17]  Selmer M. Johnson.  A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.

[18]  J. Macwilliams.  A theorem on the distribution of weights in a systematic code , 1963 .

[19]  Vera Pless,et al.  Power Moment Identities on Weight Distributions in Error Correcting Codes , 1963, Inf. Control..

[20]  J. Macwilliams.  Permutation decoding of systematic codes , 1964 .

[21]  Richard C. Singleton,et al.  Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[22]  Jack J. Stiffler,et al.  Algebraically Punctured Cyclic Codes , 1965, Inf. Control..

[23]  G. David Forney,et al.  On decoding BCH codes , 1965, IEEE Trans. Inf. Theory.

[24]  D. Kleitman.  On a combinatorial conjecture of Erdös , 1966 .

[25]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[26]  J. Leech.  Notes on Sphere Packings , 1967, Canadian Journal of Mathematics.

[27]  Shu Lin,et al.  Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application , 1966, Inf. Control..

[28]  John P. Robinson,et al.  An Optimum Nonlinear Code , 1967, Inf. Control..

[29]  Shu Lin,et al.  Long BCH Codes Are Bad , 1967, Inf. Control..

[30]  H. F. Mattson,et al.  RESEARCH TO DEVELOP THE ALGEBRAIC THEORY OF CODES. , 1968 .

[31]  E. J. Weldon.  Correction to "New Generalizations of the Reed-Muller Codes - Part II: Nonprimitive Codes" , 1968, IEEE Trans. Inf. Theory.

[32]  F. Jessie MacWilliams,et al.  On the p-Rank of the Design Matrix of a Difference Set , 1968, Inf. Control..

[33]  Franco P. Preparata.  A Class of Optimum Nonlinear Double-Error-Correcting Codes , 1968, Inf. Control..

[34]  James L. Massey,et al.  Inverses of Linear Sequential Circuits , 1968, IEEE Transactions on Computers.

[35]  V. Pless.  On the uniqueness of the Golay codes , 1968 .

[36]  K.J.C. Smith,et al.  On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry , 1969 .

[37]  H. Mattson,et al.  New 5-designs , 1969 .

[38]  Tadao Kasami.  An upper bound on k/n for affine-invariant codes with fixed d/n (Corresp.) , 1969, IEEE Trans. Inf. Theory.

[39]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[40]  G. David Forney,et al.  Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.

[41]  Vera Pless.  The Weight of the Symmetry Code for p=29 and the 5‐Designs Contained Therein , 1970 .

[42]  Daniel J. Costello,et al.  Nonsystematic convolutional codes for sequential decoding in space applications , 1971, IEEE Transactions on Communication Technology.

[43]  Jean-Marie Goethals,et al.  On the Golay Perfect Binary Code , 1971, J. Comb. Theory, Ser. A.

[44]  Anthony M. Kerdock,et al.  A Class of Low-Rate Nonlinear Binary Codes , 1972, Inf. Control..

[45]  N. J. A. Sloane,et al.  Generalizations of Gleason's theorem on weight enumerators of self-dual codes , 1972, IEEE Trans. Inf. Theory.

[46]  Vera Pless,et al.  A classification of self-orthogonal codes over GF(2) , 1972, Discret. Math..

[47]  Carlos R. P. Hartmann,et al.  Generalizations of the BCH Bound , 1972, Inf. Control..

[48]  P. Delsarte.  Bounds for unrestricted codes, by linear programming , 1972 .

[49]  Robert J. McEliece,et al.  Weight congruences for p-ary cyclic codes , 1972, Discret. Math..

[50]  Jørn Justesen,et al.  Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.

[51]  N. J. A. Sloane,et al.  Gleason's theorem on self-dual codes , 1972, IEEE Trans. Inf. Theory.

[52]  Vera Pless,et al.  Self-Dual Codes Over GF(q) Satisfy a Modified Varshamov-Gilbert Bound , 1973, Inf. Control..

[53]  N. J. A. Sloane,et al.  On the Existence of a Projective Plane of Order 10 , 1973, J. Comb. Theory, Ser. A.

[54]  G. David Forney,et al.  Structural analysis of convolutional codes via dual codes , 1973, IEEE Trans. Inf. Theory.

[55]  Philippe Delsarte,et al.  Four Fundamental Parameters of a Code and Their Combinatorial Significance , 1973, Inf. Control..

[56]  Hermann J. Helgert,et al.  Minimum-distance bounds for binary linear codes , 1973, IEEE Trans. Inf. Theory.

[57]  N. J. A. Sloane,et al.  An Upper Bound for Self-Dual Codes , 1973, Inf. Control..

[58]  P. A. Wintz,et al.  Error Free Coding , 1973 .

[59]  Hans Niemeier.  Definite quadratische formen der dimension 24 und diskriminante 1 , 1973 .

[60]  Walter Feit,et al.  A self-dual even (96, 48, 16) code (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[61]  B. R. McDonald.  Finite Rings With Identity , 1974 .

[62]  Neil J. A. Sloane,et al.  Upper bounds for modular forms, lattices, and codes , 1975 .

[63]  N. J. A. Sloane,et al.  On the Classification and Enumeration of Self-Dual Codes , 1975, J. Comb. Theory, Ser. A.

[64]  James L. Massey.  Error Bounds for Tree Codes, Trellis Codes, and Convolutional Codes with Encoding and Decoding Procedures , 1975 .

[65]  Jr. G. Forney,et al.  Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems , 1975 .

[66]  Masao Kasahara,et al.  A Method for Solving Key Equation for Decoding Goppa Codes , 1975, Inf. Control..

[67]  Jean-Marie Goethals,et al.  Unrestricted codes with the golay parameters are unique , 1975, Discret. Math..

[68]  Neil J. A. Sloane,et al.  Weight Enumerators of Codes , 1975 .

[69]  Harold N. Ward.  A Restriction on the Weight Enumerator of a Self-Dual Code , 1976, J. Comb. Theory, Ser. A.

[70]  Harold F. Mattson,et al.  Some 3-error-correcting BCH codes have covering radius 5 (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[71]  Toby Berger,et al.  Complete decoding of triple-error-correcting binary BCH codes , 1976, IEEE Trans. Inf. Theory.

[72]  van Hca Henk Tilborg,et al.  Uniformly packed codes , 1976 .

[73]  Aileen Mary Mcloughlin,et al.  On the covering radius. , 1977 .

[74]  Robert J. McEliece,et al.  New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.

[75]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[76]  Kauko Lindström.  All Nearly Perfect Codes are Known , 1977, Inf. Control..

[77]  Torleiv Kløve,et al.  The weight distribution of irreducible cyclic codes with block lengths n1((q1-1)/N) , 1977, Discret. Math..

[78]  Robert J. McEliece,et al.  The Theory of Information and Coding , 1979 .