Unit sphere packings and coverings of the Hamming space
From MaRDI portal
Publication:1823223
zbMath0679.94015MaRDI QIDQ1823223
Grigory Kabatiansky, V. I. Panchenko
Publication date: 1988
Published in: Problems of Information Transmission (Search for Journal in Brave)
94B25: Combinatorial codes
Related Items
On identifying codes in binary Hamming spaces, On a hypercube coloring problem, BCH codes and distance multi- or fractional colorings in hypercubes asymptotically, New upper bounds for the football pool problem for 11 and 12 matches, Covering and packing problems in lattices associated with the \(n\)-cube, On the structure of optimal error-correcting codes, New upper bounds for binary covering codes, On identifying codes that are robust against edge changes, Improved lower bounds on sizes of single-error correcting codes