Skip to main content
Article thumbnail
Location of Repository

New bounds on a hypercube coloring problem and linear codes

By Hung Quang Ngo, Ding-zhu Du and Ronald L. Graham

Abstract

In studying the scalability of optical networks, one problem arising involves coloring the vertices of the ¡-dimensional hypercube with as few colors as possible such that any two vertices whose Hamming distance is at ¢ most are colored differently. Determining the exact value of ¡� © , the minimum number of colors needed, appears to be a difficult problem. In this paper, we improve the known lower and upper bounds of £� ¤ § ¡� © and indicate the connec-tion of this coloring problem to linear codes

Topics: hypercube, coloring, linear codes
Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.1409
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.buffalo.edu/~hu... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.