New bounds on a hypercube coloring problem and linear codes

In studying the scalability of optical networks, one problem arising involves coloring the vertices of the n-dimensional hypercube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of /spl chi//sub k~/(n...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Hung Quang Ngo
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Block codes Computer science Hamming distance Hypercubes Linear code Optical fiber networks Scalability Sun Upper bound Vectors
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!