DocumentCode
2496347
Title
Covering radius of self-complementary codes and BCH codes
Author
Laihonen, Tero
Author_Institution
Dept. of Math., Turku Univ., Finland
fYear
1998
fDate
16-21 Aug 1998
Firstpage
434
Abstract
The problem of finding upper bounds on covering radius is considered. The given estimates depend on another fundamental parameter of a code called dual distance. We obtain a bound for the covering radii of self-complementary codes and generalize this approach to binary linear codes by applying different polynomials. We examine BCH codes with large error-correcting capability as well
Keywords
BCH codes; binary codes; dual codes; linear codes; polynomials; BCH codes; binary linear codes; code parameter; covering radius; dual distance; error-correction; polynomials; self-complementary codes; upper bounds; Block codes; Chebyshev approximation; Computer science; Data compression; Ear; Entropy; Linear code; Mathematics; Polynomials; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.709039
Filename
709039
Link To Document