Improved lower bounds on the minimum distances of the dual codes of primitive narrow-sense BCH codes

报告题目：Improved lower bounds on the minimum distances of the dual codes of primitive narrow-sense BCH codes

报告摘要：In this talk, we introduce our recent work about the lower bounds on the minimum distances of the dual codes of primitive narrow-sense BCH codes. This is a joint work with Chunyu Gan, Professor Sihem Mesnager, Conghui Xie, and Professor Haiyan Zhou

报告人简介：李成举，华东师范大学教授，博士生导师。研究方向为编码密码与信息安全，研究成果以第一或通信作者在IEEE国际旗舰期刊《IEEE Transactions on Information Theory》发表论文17篇，ESI高被引论文1篇。主持国家自然科学基金优青、面上、青年项目，入选上海市启明星、扬帆、晨光人才计划，获评2023“上海科技青年35人引领计划”。担任SCI期刊《Advances in Mathematics of Communications》编委。

报告时间：2024年11月15日上午9:00-10:00

报告地点：西南交通大学犀浦校区X7510