Linear inequalities for covering codes. I. Pair covering inequalities

DOI10.1109/18.79914zbMATH Open0731.94014OpenAlexW2065447201MaRDI QIDQ3358649FDOQ3358649

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

lower boundscovering radiuslinear 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)

Cited In (6)

• Inequalities for code pairs
• Binary codes with covering radius one: Some new lower bounds
• New lower bounds for binary covering codes
• Linear inequalities for covering codes. II. Triple covering inequalities
• Bounds for binary multiple covering codes
• Multicovering bounds from linear inequalities

Recommendations

• Title not available (Why is that?) 👍 👎
• On the Covering Dimension of a Linear Code 👍 👎
• Bounds on the covering radius of linear codes 👍 👎
• On lower bounds for covering codes 👍 👎
• Linear programming bounds for codes via a covering argument 👍 👎
• Inequalities for covering codes 👍 👎
• Some new upper bounds on the covering radius of binary linear codes 👍 👎
• The Generalized Covering Radii of Linear Codes 👍 👎
• Linearized decomposition codes and finite integer set coverings 👍 👎
• Linear inequalities for covering codes. II. Triple covering inequalities 👍 👎

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

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