On the Minimum Distance of Cyclic Codes

IEEE Transactions on Information Theory

Volumn 32, Issue 1, 1986, Pages 23-40

  Van Lint, Jacobus H ^a   Wilson, Richard M ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL PROCESSING - DIGITAL TECHNIQUES;

BCH BOUND; BINARY CYCLIC CODES; CYCLIC CODES; HT BOUND; MINIMUM DISTANCE;

CODES, SYMBOLIC;

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

References (11)

1. R. D. Baker, J. H. van Lint, and R. M. Wilson, “On the preparata and Goethals codes,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 342–345, May 1983.
2. C. R. P. Hartmann and K. K. Tzeng, “Generalizations of the BCH bound,” Inform. Contr., vol. 20, pp. 489–498, 1972.
3. J. H. van Lint, Coding Theory, Lecture Notes in Mathematics, vol. 201. New York: Springer-Verlag, 1973.
4. ——, Introduction to Coding Theory. New York: Springer-Verlag, 1982.
5. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Cor-recting Codes. Amsterdam: North-Holland, 1977.
6. R. J. McEliece, “Weight congruences for p-ary cyclic codes,” Discrete Math., vol. 3, pp. 177–192, 1972.
7. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA:MIT Press, 1972.
8. C. Roos, “A new lower bound for the minimum distance of a cyclic code,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 330–332, May 1983.
9. —, “A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound,” J. Comb. Theory, Ser A, vol. 33, pp. 229–232, 1982.
10. R. M. Wilson, “A method for bounding the minimum distance of cyclic codes,” in Proc. 14th S. E. Conf. Combinatorics, Graph Theory and Computing = Congressus Numerantium, vol. 40, pp. 429–435, 1983.
11. D. E. Downie and N. J. A. Sloane, “The covering radius of cyclic codes of length up to 31,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 446–447, May 1985.