Linear inequalities for covering codes. I. Pair covering inequalities

DOI10.1109/18.79914zbMath0731.94014OpenAlexW2065447201MaRDI QIDQ3358649

Zhen Zhang

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.79914

zbMATH Keywords

covering radiuslower boundslinear inequalityHamming association scheme

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (3)

Unnamed Item ⋮ Binary codes with covering radius one: Some new lower bounds ⋮ Bounds for binary multiple covering codes

This page was built for publication: Linear inequalities for covering codes. I. Pair covering inequalities