An Asymptotic Bound on the Covering Radii of Binary BCH Codes

IEEE Transactions on Information Theory

Volumn 36, Issue 1, 1990, Pages 211-213

  Tietavainen, Aimo ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BCH CODES; BINARY CODES; COVERING RADIUS; DELIGNE'S THEOREM;

CODES, SYMBOLIC;

EID: 0025209337     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.50395     Document Type: Article

References (12)

1. L. Carlitz and S. Uchiyama, “Bounds for exponential sums,” Duke Math. J., vol. 24, pp. 37–41, 1957.
2. P. Deligne, “La conjecture de Weil. I,” Inst. Hautes Etudes Sci. Puhl. Math., vol. 43, pp. 273–307, 1974.
3. D. C. Gorenstein, W. W. Peterson, and N. Zierler, “Two-error correcting Bose-Chaudhury codes are quasiperfect,” Inform, and Contr., vol. 3, pp. 291–294, 1960.
4. T. Helleseth, “All binary 3-error-correcting BCH codes of length 2 m -1 have covering radius 5,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 257–258, 1978.
5. T. Helleseth, “On the covering radius of cyclic linear codes.and arithmetic codes,” Discrete Appl. Math., vol. 11, pp. 157–173, 1985.
6. J. A. van der Horst and T. Berger, “Complete decoding of triple-error-correcting binary BCH codes,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 138–147, 1976.
7. S. Lang and A. Weil, “Number of points of varieties in finite fields,” Amer. J. Math., vol. 76, pp. 819–827, 1954.
8. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
9. C. J. Moreno and O. Moreno, “Exponential sums and Goppa codes: I,” Proc. Amer. Math. Soc. (submitted).
10. A. N. Skorobogatov, “On the covering radius of BCH codes,” Abstracts of Papers, Soviet - Swedish Inform. Theory Symp., Sochi, USSR, 1987, pp. 308–309.
11. A. Tietavainen, “On the covering radius of long binary BCH codes,” Discrete Appl. Math., vol. 16, pp. 75–77, 1987.
12. A. Tietavainen, “On the covering radius of long binary BCH codes,” Abstracts of Papers, Int. Symp. Inform. Theory, Ann Arbor, MI, p. 40, 1986.