A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Odd and even hamming spheres also have minimum boundary
1984
Discrete Mathematics
Combinatorial problems with a geometric flavor arise if the set of all binary sequences of a fixed len@h n, is provided with the Hamming distance. The Hamming dkcunce of any two binary sequences is the number of positions in which they differ. The (outer) boundary of a set A of binary sequences is the set of ail sequences outside A that are at distance 1 Erom some sequence in A. Harper [6] proved that among all the sets of a prescribed volume, the 'sphere' has minimum boundary. We show that
doi:10.1016/0012-365x(84)90068-2
fatcat:tzqlig6m7rbwxocwfhvobgsd4y