Generalization of the Norse bounds to codes of higher strength

DOI10.1109/18.61138zbMath0712.94016OpenAlexW2027162447MaRDI QIDQ3197757

Kishan G. Mehrotra, Patrick Solé

Publication date: 1991

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

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

zbMATH Keywords

covering radiusbinary codeNorse bounds

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 ⋮ The covering radius of spherical designs ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Covering radius and dual distance

This page was built for publication: Generalization of the Norse bounds to codes of higher strength