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.
Covering six space with spheres
β Scribed by A.C Woods
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 884 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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
The title statement is proved. Similar results for arbitrary Banach spaces are obtained in both the real-analytic and the \(C^{\prime \prime}\) settings. 1995 Academic Press. Inc.