Abstract
We present a uniform approach towards deriving upper bounds on the covering radius of a code as a function of its dual distance structure and its cardinality. We show thai the bounds obtained previously by Delsarte, Helleseth et al., Tietäväinen, resp. Solé and Stokes follow as special cases. Moreover, we obtain an asymptotic improvement of these bounds using Chebyshev polynomials.
Original language | English |
---|---|
Pages (from-to) | 177-191 |
Number of pages | 15 |
Journal | Discrete Applied Mathematics |
Volume | 82 |
Issue number | 1-3 |
DOIs | |
State | Published - 2 Mar 1998 |
Keywords
- Asymptotic bounds
- Chebyshev polynomials
- Coding theory
- Covering radius
- Dual distance
- MacWilliams transform