On the Minimum Distance of Certain Reversible Cyclic Codes

IEEE Transactions on Information Theory

Volumn 16, Issue 5, 1970, Pages 644-646

  Hartmann, C R P ^b  

^a LEHIGH UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; CYCLIC CODES; ERROR-CORRECTING CODES; IETTA; INFORMATION THEORY;

EID: 0014853654     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1970.1054517     Document Type: Article

References (5)

1. J. L. Massey, “Reversible codes,” Inform. and Control, vol. 7, pp. 369–380, September 1964.
2. W. W. Peterson, Error Correcting Codes. Cambridge, Mass.: M.I.T. Press, and New York: Wiley, 1961, p. 161.
3. D. Knee and H. D. Goldman, “Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes,” IEEE Trans. Information Theory, vol. IT-15, pp. 118–121, January 1969.
4. C. M. Melas, “A cyclic code for double error correction,” IBM J. Research and Development, vol. 4, pp. 364–366, July 1960.
5. L. H. Zetterberg, “Cyclic codes from irreducible polynomials for correction of multiple errors,” IRE Trans. Information Theory, vol. IT-8, pp. 13–20, January 1962.