Inequalities for covering codes

DOI10.1109/18.21257zbMATH Open0665.94021OpenAlexW2003023463MaRDI QIDQ3818251

Robert Calderbank, N. J. A. Sloane

Publication date: 1989

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

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

zbMATH Keywords

covering radiuslinear codelinear inequalitiessphere boundLloyd polynomiallow weight vectorssyndrome graphs

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 (3)

Covering properties of convolutional codes and associated lattices ⋮ Bounds for codes with unequal protection of two sets of messages ⋮ Inequalities for code pairs

This page was built for publication: Inequalities for covering codes

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