Tiling Hamming space with few spheres

[摘要] 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.

[发布日期] 1997-11-01