报告人：王小强

工作单位：湖北大学

报告题目：Binary Linear Codes from Boolean Functions

报告时间：2024年11月21日（周四）19:00-21:00

报告地点：腾讯会议（815611496）

报告摘要：

Boolean functions have very nice applications in coding theory and cryptography. In coding theory, Boolean functions have been used to construct linear codes in different ways. The objective of this paper is to construct binary linear codes with few weights using the defining-set approach. The defining sets of the codes presented in this paper are defined by some special Boolean functions and some additional restrictions. First, two families of binary linear codes with at most three or four weights from Boolean functions with at most three Walsh transform values are constructed and the parameters of their duals are also determined. Then several classes of binary linear codes with explicit weight enumerators are produced. Some of the binary linear codes are optimal or almost optimal according to the tables of best codes known maintained at http://www.codetables.de, and the duals of some of them are distance-optimal with respect to the sphere packing bound.

报告人简介：

王小强，湖北大学副教授，硕士生导师。2016年于华中师范大学获博士学位，导师刘宏伟教授；随后于香港科技大学和湖北大学继续从事关于代数编码方面的博士后工作，合作导师为丁存生教授和曾祥勇教授。主要研究密码、编码及其相关的数学理论。近年来在线性码、BCH码等领域做出了⼀系列成果，主持国家自然科学基金1项、湖北省面上基金1项，在国内外重要学术期刊《IEEE Transactions on Information Theory》、《Designs, Codes and Cryptography》和《Finite Fields and Their Applications》等发表论文40余篇。2024年入选武汉市优秀青年人才。