Codes and Distance-Regular Graphs
报告题目(Title)：Codes and Distance-Regular Graphs
报告人(Speaker)：高锁刚 教授 (河北师范大学)
地点(Place)：腾讯会议 ID：496 838 544
时间(Time)：2021年4月2日（周五）下午16:30-17:30
邀请人(Inviter)：吕本建, 王恺顺
报告摘要
The beginning of coding theory goes back to the middle of the last century with the work of Shannons, Hamming, Golay and others. Historically coding theory originated as the mathematical foundation for the transmission of messages over noisy channels. Mathematical background was at the beginning very little but with passing of time, various mathematical tools, such as group theory, ring theory, graph theory, and linear programming have been applied to coding theory. In this talk, we mainly introduce the application of distance-regular graphs to codes.
主讲人简介
高锁刚，河北师范大学数学科学学院教授、博士生导师，主要从事典型群、代数组合论、组合优化等方面的研究，在J. Combin. Theory A、 J. Algebraic Combin.、 European J. Combin.、J. Global Optim.、Theoret. Comput. Sci. 等国内外核心期刊发表论文80余篇（其中SCI文章60余篇）。在科学出版社出版一部专著《距离正则图及其相关代数》，担任Discrete Math. Algorithms Appl.杂志编委。主持三项国家自然科学基金、一项教育部博士点基金、两项河北省自然科学基金。作为第一完成人获河北省科学技术奖二等奖1项、三等奖1项。
