题目：Two Hypercube Coloring Problems
摘要：We study the following two hypercube coloring problems: Given n and d, find the minimum number of colors needed to color the vertices of the n-cube such that any two vertices with Hamming distance at most d (resp. exactly d) have different colors. These problems originally arose in the study of the scalability of optical networks. In this talk we present some new results obtained by using methods in coding theory.