New bounds on covering radius as a function of dual distance



: Laihonen T, Litsyn S

Publisher: SIAM PUBLICATIONS

: 1999

: Siam Journal on Discrete Mathematics

: SIAM JOURNAL ON DISCRETE MATHEMATICS

: SIAM J DISCRETE MATH

: 12

: 2

: 243

: 251

: 9

: 0895-4801

DOI: https://doi.org/10.1137/S0895480197331703


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.



Last updated on 2024-26-11 at 13:31