Linear inequalities for covering codes. I. Pair covering inequalities
From MaRDI portal
Publication:3358649
DOI10.1109/18.79914zbMath0731.94014MaRDI QIDQ3358649
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
94B65: Bounds on codes
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
Bounds for binary multiple covering codes, Binary codes with covering radius one: Some new lower bounds, Unnamed Item