Colorings of Hamming-Distance Graphs
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 speci...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
UKnowledge
2017
|
| Subjects: | |
| Online Access: | http://uknowledge.uky.edu/math_etds/49 http://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1048&context=math_etds |