缪莹教授：信息论中组合问题系列报告（共四讲）
缪莹教授：信息论中组合问题系列报告（共四讲）
报告题目：Some open combinatorial problems related with information theory
报告人：Ying Miao(缪莹)教授日本筑波大学(University of Tsukuba)
报告时间：2019年9月16日-17日，9:00-10:00，10：20-11：20
报告地点：精正楼301
报告摘要: In this talk, we describe some open combinatorial problems related with information communications, information storage, and information security.
Signature codes are used in weighted binary adder channel and collusion-resistant multimedia fingerprinting. We describe the determination problem of the maximum cardinality of a signature code in a geometric way, and explain some of our new results.
BCH codes are among the best practical cyclic codes used in communication systems and storage devices. We construct BCH codes with minimum distance proportional to the code length. We show that the general problem of determining the dimensions of these BCH codes can be reduced to an enumeration problem of restricted range of integers.
Locally reparable codes are used in large-scale cloud storage and distributed file systems. In order to derive upper bounds on the length of a locally reparable code, we need to find a minimum family of repair sets which covers the column vectors of the generator matrix. We explain some of our recent results.
报告人简介：缪莹教授1997年博士毕业于日本广岛大学，现任日本筑波大学社会工学系教授。2001年被国际数学组织ICA（The Institute of Combinatorics and its Applications）授予Kirkman奖章。缪莹教授在组合设计及编码密码学等领域连续取得了多项重要成果并解决了多个长期未决的猜想和公开问题，迄今已在诸如《J. Combin. Theory Ser. A》，《SIAM J. Discrete Math.》，《IEEE Trans. Inform. Theory》等国际著名刊物上发表了近70篇论文。现为国际著名数学SCI刊物《J. Combin. Des.》，《Graphs Combin.》的编委。