Tiling Hamming space with few spheres (Q1374207)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1093117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tiling Hamming space with few spheres |
scientific article; zbMATH DE number 1093117 |
Statements
Tiling Hamming space with few spheres (English)
0 references
2 December 1997
0 references
A binary generalized perfect code is a partition of \(\mathbb F^n_2\) into \(M\) spheres (or better: balls) with possibly different radii. It is shown that for such a partition, either \(M\leq 2\) (trivial cases) or \(M\geq n+2\). If \(M=n+2\), then one of the spheres has radius \(n-2\) and all others consist of one point. The proof depends on the well-known De Bruijn-Erdös theorem on the number of lines in a linear space.
0 references
tiling
0 references
Haming space
0 references
generalized Steiner system
0 references
generalized perfect code
0 references
0 references
0.8058173060417175
0 references
0.8014795184135437
0 references
0.7995455265045166
0 references
0.7863667607307434
0 references
