Covering radius of self-complementary codes and BCH codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 434-

  Laihonen, T ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BCH CODE; BINARY LINEAR CODES; COVERING RADIUS; DUAL DISTANCE; ERROR-CORRECTING; UPPER BOUND;

INFORMATION THEORY;

EID: 84890395442     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.709039     Document Type: Conference Paper

References (2)

1. I. Honkala, T. Laihonen and S. Litsyn,"On covering radius and discrete Chebyshev polynomials," Appl. Algebra Engrg. Comnx. Comput., vol. 8, pp. 395-402, 1997.
2. T. Laihonen and S. Litsyn, "New bounds on covering radius as a function of dual distance," SIAM J. Discr. Math., submitted for publication.