Unit sphere packings and coverings of the Hamming space
From MaRDI portal
Publication:1823223
zbMath0679.94015MaRDI QIDQ1823223
V. I. Panchenko, Grigory Kabatiansky
Publication date: 1988
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (13)
New upper bounds for the football pool problem for 11 and 12 matches ⋮ On identifying codes that are robust against edge changes ⋮ Covering and packing problems in lattices associated with the \(n\)-cube ⋮ Improved lower bounds on sizes of single-error correcting codes ⋮ BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ On the structure of optimal error-correcting codes ⋮ New upper bounds for binary covering codes ⋮ Constructing error-correcting binary codes using transitive permutation groups ⋮ Nearest neighbor representations of Boolean functions ⋮ On anti-stochastic properties of unlabeled graphs ⋮ Spanning Trees and Domination in Hypercubes ⋮ On identifying codes in binary Hamming spaces ⋮ On a hypercube coloring problem
This page was built for publication: Unit sphere packings and coverings of the Hamming space
