On the covering radius of an unrestricted code as a function of the rate and dual distance

Simon Litsyn, Patrick Solé*, René Struik

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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 languageEnglish
Pages (from-to)177-191
Number of pages15
JournalDiscrete Applied Mathematics
Volume82
Issue number1-3
DOIs
StatePublished - 2 Mar 1998

Keywords

  • Asymptotic bounds
  • Chebyshev polynomials
  • Coding theory
  • Covering radius
  • Dual distance
  • MacWilliams transform

Fingerprint

Dive into the research topics of 'On the covering radius of an unrestricted code as a function of the rate and dual distance'. Together they form a unique fingerprint.

Cite this