We show that if the collection of all binary vectors of length n is partitioned into k spheres, then either k less than or equal to 2 or k greater than or equal to n + 2. Moreover, such partitions with k = n + 2 are essentially unique. (C) 1997 Academic Press.
Tiling Hamming space with few spheres / Henk D. L., Hollmann; Korner, Janos; Simon, Litsyn. - In: JOURNAL OF COMBINATORIAL THEORY. SERIES A. - ISSN 0097-3165. - STAMPA. - 80:2(1997), pp. 388-393. [10.1006/jcta.1997.2816]
Tiling Hamming space with few spheres
KORNER, JANOS;
1997
Abstract
We show that if the collection of all binary vectors of length n is partitioned into k spheres, then either k less than or equal to 2 or k greater than or equal to n + 2. Moreover, such partitions with k = n + 2 are essentially unique. (C) 1997 Academic Press.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
