讲座题目：Optimal minimal linear codes from posets 主讲人⚠️：吴严生 教授 主持人💁🏻⭐️：李成举 开始时间🛼：2020-11-30 16:30:00 结束时间🚣🏽♀️💁🏽：2020-11-30 17:30:00 讲座地址🛃🎅🏽：腾讯会议 ID：775 532 368 主办单位：软件工程学院
报告人简介： 吴严生👩🏻，现任南京邮电大学教授。欧洲数学会《数学文摘》🦕、美国数学会《数学评论》评论员。以第一作者或通讯作者在IEEE Transactions on Information Theory、IEEE Communications Letters、Designs Codes and Cryptography、Finite Fields and Their Applications、Discrete Applied Mathematics👩🏿⚕️、Discrete Mathematics 等国际期刊上发表 SCI 论文 17 篇🫳🏼🙆🏻。主要研究方向为代数编码理论👁🗨、密码函数。 报告内容： Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. In talk, we will first extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to simplicial complexes. Secondly, we will present two constructions of binary linear codes from hierarchical posets of two levels. In particular, we determine the weight distributions of binary linear codes associated with hierarchical posets with two levels. Based on these results, we also obtain some optimal and minimal binary linear codes not satisfying the condition of Ashikhmin-Barg. Moreover, we will also put up many worthwhile questions. |
