Abstract
Let be the number of colors required to color the -dimensional hypercube such that no two vertices with the same color are at a distance at most . In other words, is the minimum number of binary codes with minimum distance at least required to partition the -dimensional Hamming space. By giving an explicit coloring, it is shown that .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.