Jon-Lark Kim: Recent results on binary optimal self-orthogonal codes

报告时间：2023年10月25日（星期三）16:30-17:30 报告地点：翡翠湖校区科教楼B1710室 报 告 人：Jon-Lark Kim 教授 工作单位：Sogang University 举办单位：数学学院 报告简介： Self-orthogonal codes have been less studied because they are theoretically harder to formulate than self-dual codes. Kim and Choi (2022) proposed a method to construct self-orthogonal codes from non-self-orthogonal codes and introduced the concept of self-orthogonal embedding. In this talk, we explain this concept and describe the best possible minimum weights of binary self-orthogonal codes when the dimension is at most 7. 报告人简介： Jon-Lark Kim 是韩国西江大学教授，国际著名的代数编码与组合论专家，曾获国际组合数学及其应用协会颁发的 Kirkman 奖。目前已在信息论领域 Top 期刊IEEE Transaction on Information Theory和组合数学顶级期刊J. Combinatorial Theory Ser. A等国际权威期刊上发表 100余篇学术论文，在国际学术会议上发表论文20余篇，主持过多项国家重大项目，获得多项国家发明专利，目前担任Designs, Codes and Cryptography等多个国际权威期刊的编委会成员。