On relations between covering radius and dual distance

DOI10.1109/18.782101zbMath0959.94037OpenAlexW2138182514MaRDI 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

zbMATH Keywords

covering radiuslinear codesboundconstant weight codesasymptotic boundsdual distanceKrawtchouk polynomial

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

Bounds on Distance Distributions in Codes of Given Size ⋮ Linear programming bounds for codes via a covering argument

This page was built for publication: On relations between covering radius and dual distance