Colorings of Hamming-Distance Graphs

Isaiah H. Harney
Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number. A notion of robustness is defined for colorings of these graphs based on the tolerance of swapping colors along an edge without...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.