学术报告
Two Hypercube Coloring Problems-符方伟 教授（南开大学）
作者：
时间： 2017-05-19
阅读：
题目：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.
时间：5月19日（周五）下午14:00-15:00
地点：首都师范大学新教二楼524教室
欢迎全体师生积极参加！
