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

DOI10.1109/18.59949zbMath0713.94019OpenAlexW1997243777MaRDI QIDQ3199332

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

covering radiuscodeminimum distanceBCH codedual distance

Mathematics Subject Classification ID

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

Related Items (5)

On the covering radius of an unrestricted code as a function of the rate and dual distance ⋮ 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