On relations between covering radius and dual distance
From MaRDI portal
Publication:4503375
DOI10.1109/18.782101zbMath0959.94037MaRDI QIDQ4503375
Tero Laihonen, Alexei Ashikhmin, Simon N. Litsyn, Iiro S. Honkala
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.782101
covering radius; linear codes; bound; constant weight codes; asymptotic bounds; dual distance; Krawtchouk polynomial
94B05: Linear codes (general theory)
94B65: Bounds on codes
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
Linear programming bounds for codes via a covering argument, Bounds on Distance Distributions in Codes of Given Size