Covering radius and dual distance

DOI10.1007/BF00123957zbMath0734.94020OpenAlexW148590762MaRDI QIDQ811480

Aimo Tietäväinen

Publication date: 1991

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00123957

zbMATH Keywords

covering radiusdual distancefinite abelian group

Mathematics Subject Classification ID

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

Related Items (4)

On the covering radius of an unrestricted code as a function of the rate and dual distance ⋮ On the covering radius of Reed-Muller codes ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Weight distribution and dual distance

Cites Work

• An optimal polynomial for a covering radius problem
• Weight congruence for p-ary cyclic codes
• Generalization of the Norse bounds to codes of higher strength
• An upper bound on the covering radius as a function of the dual distance
• Asymptotic bounds on the covering radius of binary codes
• Exponential sums and Goppa codes. II
• On the covering radius of binary codes (Corresp.)
• Linear programming bounds for tree codes (Corresp.)
• On the coveting radius of extremal self-dual codes
• Four fundamental parameters of a code and their combinatorial significance
• An upper bound for self-dual codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering radius and dual distance