报告题目：On the Ding and Helleseth’s 7th open problem about optimal ternary cyclic codes
报告时间：2023年11月21日15:00-16:00
报告人：廖群英教授
报告地点：西南交通大学犀浦校区7510
报告内容:In 2013,Ding, et al. presented nine open problems about optimal ternary cyclic codes.The first two and the 6th problems were completely solved, and the third and last three problems were partially solved. In this talk, we focus on the 7th problem. By determining the root set of some special polynomials over finite fields, we give an incomplete answer and then present a counterexample. Furthermore, we also construct two new classes of optimal ternary cyclic codes with respect to the Sphere Packing Bound by studying some special polynomials over finite fields.
报告人简介：廖群英，四川师范大学博士研究生导师、清华大学博士后、中国数学奥林匹克高级教练员，主要从事编码和密码的数学理论研究，曾参加国家自然科学基金重点项目一项，主持自然科学青年基金和面上项目、教育部博士点基金项目、四川省杰出青年学术技术带头人培育计划项目、四川省科技厅应用基础研究计划重点项目，主研总参与研项目等；入选成都市优秀女性人才信息库，第十一批四川省学术技术带头人后备人选。
欢迎各位同学积极参听！
主办：西南交通大学研究生院
承办：信息科学与技术学院
