We show that if the collection of all binary vectors of length n is partitioned into k spheres, then either k 2 or k n+2. Moreover, such partitions with k=n+2 are essentially unique. ## 1997 Academic Press Recently there has been some interest in the combinatorics of the geometry of the Hamming sp
Good coverings of Hamming spaces with spheres
✍ Scribed by Gérard Cohen; Peter Frankl
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 421 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
We give a non-constructive proof ot the existence of good coverings of binary and non binary Hamming spaces by spheres centered on a subspace (linear codes). The results hold for tiles other than spheres.
📜 SIMILAR VOLUMES
## Abstract In this paper, we present a generalization of a result due to Hollmann, Körner, and Litsyn [9]. They prove that each partition of the __n__‐dimensional binary Hamming space into spheres consists of either one or two or at least __n__ + 2 spheres. We prove a __q__‐ary version of that gap
It is shown that the shadow of a Sperner family can cover 10 percent of the Boolean algebra. Whether this can be improved to (100 -o(l))% remains open. 1 a91 < c( J2) -=I C' 5 (l-1) holds for every Sperner family 97 This was disproved by Kospanov [8] who