An upper bound on the covering radius as a function of the dual distance

DOI10.1109/18.59949MaRDI QIDQ3199332zbMATH OpenOpenAlexFDO

Authors Aimo Tietäväinen

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.59949

zbMATH Keywords

codeminimum distancecovering radiusBCH codedual distance

Mathematics Subject Classification ID

Cyclic codes (94B15) Combinatorial codes (94B25)

Recommendations

• Covering radius, codimension, and dual-distance width
• Upper bounds on the covering radius of a code with a given dual distance
• Packing radius, covering radius, and dual distance
• On the covering radius of an unrestricted code as a function of the rate and dual distance
• On an algebraic method for bounding the covering radius

Cited in

(9)

• An Upper Bound on Covering Radius
• On the covering radius of an unrestricted code as a function of the rate and dual distance
• scientific article; zbMATH DE number 4185547 (Why is no real title available?)
• Linear programming bounds for codes via a covering argument
• Covering radius and dual distance
• The covering radius of spherical designs
• The two covering radius of the two error correcting BCH code
• An asymptotic bound on the covering radii of binary BCH codes
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces

This page was built for publication: An upper bound on the covering radius as a function of the dual distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3199332)