天元讲堂（12.3）：Combinatorial Feature and Binding of Binary Codes
报告题目： Combinatorial Feature and Binding of Binary Codes
报告人： 殷剑兴 苏州大学教授 博士生导师报告时间: 2016年12月3日下午16:00报告地点:数学楼2楼学术报告厅 报告摘要:
It is by now well known that there is an intimate link between coding theory and combinatorics. As MacWilliams and Sloane said, the most basic problem in coding theory is to find maximum codes for given length n and minimum Hamming distance. In order to determine the maximality of a code, it is crucial to establish theoretic bounds on the size of a code. This talk concerns binary codes. The combinatorial feature and binding techniques are touched upon.