Inequalities for covering codes

DOI10.1109/18.21257MaRDI QIDQ3818251zbMATH OpenOpenAlexFDO

Authors 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 inequalitiesLloyd polynomiallow weight vectorssphere boundsyndrome 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)

Recommendations

• Linear inequalities for covering codes. II. Triple covering inequalities
• Lower bounds on t(n, k) from linear inequalities
• An improved sphere covering bound for the codes with n=3R+2
• Linear inequalities for covering codes. I. Pair covering inequalities
• Multicovering bounds from linear inequalities

Cited in

(5)

• Bounds for codes with unequal protection of two sets of messages
• Linear inequalities for covering codes. I. Pair covering inequalities
• Linear inequalities for covering codes. II. Triple covering inequalities
• Covering properties of convolutional codes and associated lattices
• 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)