A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Covering radius of self-complementary codes and BCH codes
Tekijät: Laihonen T
Julkaisuvuosi: 1998
Tietokannassa oleva lehden nimi: 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS
Aloitussivu: 434
Lopetussivu: 434
Sivujen määrä: 1
ISBN: 0-7803-5000-6
DOI: https://doi.org/10.1109/ISIT.1998.709039
Tiivistelmä
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.
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.
Turun yliopiston Tutkimustietojärjestelmän portaali