Covering radius of self-complementary codes and BCH codes

: Laihonen T

: 1998

: 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS

: 434

: 1

: 0-7803-5000-6

DOI: https://doi.org/10.1109/ISIT.1998.709039

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 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.