A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
New bounds on covering radius as a function of dual distance
Tekijät: Laihonen T, Litsyn S
Kustantaja: SIAM PUBLICATIONS
Julkaisuvuosi: 1999
Journal: Siam Journal on Discrete Mathematics
Tietokannassa oleva lehden nimi: SIAM JOURNAL ON DISCRETE MATHEMATICS
Lehden akronyymi: SIAM J DISCRETE MATH
Vuosikerta: 12
Numero: 2
Aloitussivu: 243
Lopetussivu: 251
Sivujen määrä: 9
ISSN: 0895-4801
DOI: https://doi.org/10.1137/S0895480197331703
Tiivistelmä
In this paper we estimate covering radius when dual distance is known. We derive new bounds on covering radii of linear codes. A bound for self-complementary codes is also presented. The improvements of these bounds on the known results are based on the knowledge of the cardinality of constant weight codes and on the behavior of Hahn polynomials and discrete Chebyshev polynomials.
In this paper we estimate covering radius when dual distance is known. We derive new bounds on covering radii of linear codes. A bound for self-complementary codes is also presented. The improvements of these bounds on the known results are based on the knowledge of the cardinality of constant weight codes and on the behavior of Hahn polynomials and discrete Chebyshev polynomials.
Turun yliopiston Tutkimustietojärjestelmän portaali