报告题目：Constructing linear codes from some two-to-one maps

报告专家：曹喜望教授（南京航空航天大学）

报告时间：10月30日（周三）下午 14:30-15:30

报告地点：腾讯会议 ID 242-692-268

主办单位：曲阜师范大学数学科学学院

报告摘要：Minimal linear codes have important applications in secure communications, including in the framework of secret sharing schemes and secure multi-party computation. In this talk, I will expand the class of codes derived from the paper of Li et al. by proposing larger classes of binary linear codes with few weights via generic constructions involving other known families of two-to-one functions over the finite field F_{2^n} of order 2^n. The linear codes presented differ in parameters from those known in the literature. Besides, some of them are optimal concerning the well-known Griesmer bound. Notably, we prove that our codes are either optimal or almost optimal with respect to the online Database of Grassl. We next observe that the derived binary linear codes also have the minimality property for most cases. We then describe the access structures of the secret-sharing schemes based on their dual codes. Finally, we solve two problems left open in the paper by Li et al. (more specifically, a complete solution to Problem 2 and a partial solution to Problem 1). This is a joint work with Mesnager and Qian et al.

专家简介：曹喜望，南京航空航天大学理学院教授，博士生导师。获得北京大学博士学位。研究方向: 有限域及其应用。在差集、指数和、有限域上的多项式、量子信息处理以及代数编码方面做出了出色的工作，其研究成果发表在相关领域的期刊IEEE Transaction on Information Theory、Finite Fields and their Applications、Design Codes and Cryptography、Science China（Mathematics）等，发表学术论文200余篇，其中SCI检索论文170余篇。曹喜望教授先后多次访问过Sydney大学、南洋理工大学，香港科技大学、台湾中央研究院、北京国际数学中心、南开大学陈省身数学研究所等。2010年入选江苏省“青蓝工程”学术带头人。主持完成国家自然科学基金项目5项和省部级科研项目多项。2017年获得江苏省科学技术奖。