Construction of a (64,237,12) Code via Galois Rings

Designs, Codes, and Cryptography

Volumn 10, Issue 2, 1997, Pages 157-165

  Calderbank, A R ^a   Mcguire, Gary ^b  

^a AT AND T LABS RESEARCH   (United States)

^b University of Virginia   (United States)

Author keywords

Algebraic coding theory; Codes over rings

Indexed keywords

EID: 0000520343     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008240319733     Document Type: Article

References (8)

1. A. E. Brouwer and T. Verhoeff, An updated table of minimum distance bounds for binary linear codes, IEEE Trans. Inform. Theory, Vol. 39 (1993) pp. 662-677.
2. 37, 12) code via Galois Rings, AT&T Bell Laboratories Technical Memorandum BL011218-941102-44 (1994).
3. 4, locator polynomials and Newtons identities, IEEE Trims. Inform. Theory, Vol. 42 (1996) pp. 217-226.
4. A. R. Calderbank and N. J. A. Sloane, Modular and p-adic cyclic codes, Designs, Codes and Cryptography, Vol. 6, (1995) pp. 21-35.
5. 4-linearity of Kerdock, Preparata, Goethals and related codes, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 301-319.
6. A. M. Kerdock, A class of low-rate nonlinear binary codes, Inform. and Control, Vol. 20 (1972) pp. 182-187.
7. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977).
8. F. P. Preparata, A class of optimum nonlinear double-error correcting codes, Inform. and Control, Vol. 13 (1968) pp. 378-400.