Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points

DOI10.1137/S0895480193252100zbMath0829.94012MaRDI QIDQ4837648

Patric R. J. Östergård, Iiro S. Honkala, Simon N. Litsyn, Heikki O. Hämäläinen

Publication date: 24 January 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

covering radiusbinary codemultiple coveringfootball pool problem

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) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

Further results on multiple coverings of the farthest-off points ⋮ New upper bounds for binary covering codes ⋮ On lengthening of covering codes ⋮ Multiple coverings of the farthest-off points with small density from projective geometry

This page was built for publication: Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points