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

DOI10.1109/18.59949zbMATH Open0713.94019OpenAlexW1997243777MaRDI QIDQ3199332FDOQ3199332

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

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

zbMATH Keywords

codeminimum distancecovering radiusBCH codedual distance

Mathematics Subject Classification ID

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

Cited In (9)

• On the covering radius of an unrestricted code as a function of the rate and dual distance
• An Upper Bound on Covering Radius
• An asymptotic bound on the covering radii of binary BCH codes
• The two covering radius of the two error correcting BCH code
• Title not available (Why is that?)
• The covering radius of spherical designs
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• Linear programming bounds for codes via a covering argument
• Covering radius and dual distance

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)