More on the covering radius of BCH codes

IEEE Transactions on Information Theory

Volumn 42, Issue 3, 1996, Pages 1023-1028

  Levy dit Vehel, Françoise ^a   Litsyn, Simon ^b  

^a INRIA   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

BCH codes; Covering radius; Systems of equations over unite fields

Indexed keywords

ALGORITHMS; BLOCK CODES; DECODING; ERROR ANALYSIS; ERROR CORRECTION; INFORMATION THEORY; OPTIMIZATION;

COVERING RADIUS; ERROR CORRECTING CODES; FINITE FIELDS; LOWER BOUNDS; SYSTEMS OF EQUATIONS;

CODES (SYMBOLS);

EID: 0030151208     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.490570     Document Type: Article

References (15)

1. E.F. Assmus Jr. and H. F. Mattson Jr., "Some 3-error correcting BCH codes have covering radius 5," IEEE Trans. Inform. Theory, vol. IT-22, pp. 348-349, 1976.
2. G.D. Cohen. M. G. Karpovsky, H. F. Mattson Jr., and J. R. Schatz, "Covering radius-Survey and recent results," IEEE Trans. Inform. Theory, vol. IT-31, pp. 328-343, 1985.
3. G.D. Cohen, S. N. Litsyn, A. C. Lobstein, and H. F. Mattson Jr., "Covering radius 1985-1994," submitted.
4. D. Gorenstein, W. W. Peterson, and N. Zierler, "Two-error correcting Bose-Chaudhury codes are quasiperfect," Inform. Comr., vol. 3, pp. 291-294, 1960.
5. m-1 have covering radius 5," IEEE Trans. Inform. Theory, vol. IT-24, pp. 257-258, 1978.
6. _, "On the covering radius of cyclic linear codes and arithmetic codes," Discr. Appl. Math., vol. 11, pp. 157-173, 1985.
7. I.S. Honkala and A. Tietäväinen, "Codes and number theory," in Handbook of Coding Theory, R. A. Brualdi, W, C. Huffman, and V. S. Pless, Eds., to appear.
8. J.A. van der Horst and T. Berger, "Complete decoding of triple-errorcorrecting binary BCH codes," IEEE Trans. Inform. Theory, vol. IT-22, pp. 138-147, 1976.
9. Y. Kapainen, peisonal communication.
10. F.J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
11. O. Moreno and C. J. Moreno, "Constructive elementary approach to the covering radius of long BCH codes," in Abstracts of Papers of 2nd Int. Workshop on Algebraic and Combinatorial Coding Theory (Leningrad, USSR, 1990), pp. 162-165.
12. G. Szegö, "Orthogonal polynomials," Amer. Math. Soc. Colloq. Publ. (Providence, RI), vol. 23, 1975.
13. A. Tietäväinen, "On the covering radius of long binary7 BCH codes," Discr. Appl. Math., vol. 16, pp. 75-77, 1987.
14. _, "An asymptotic bound on the covering radii of binary BCH codes," IEEE Trans. Inform. Theory, vol. 36, pp. 211-213, 1990.
15. S.G. Vläduts and A. N. Skorobogatov, "Covering radius for long BCH codes," Probl. Pered. Inform., vol. 25, pp. 38-45, 1989. Translated in: Probl. Inform. Transm., vol. 25, no. 1, pp. 28-34, 1989.