密码学与信息安全团队2021-2022(1)系列报告(二)
报告题目:Infinite families of $2$-designs derived from linear codes
报告人:杜小妮(西北师范大学教授)
报告时间:2021年9月29日(星期三),19:00-20:30
报告地点:腾讯会议ID:481 411 379;会议密码:123456
报告摘要:It is generally known that t-designs can be used to derive linear codes over any finite field, and that the supports of all codewords with a fixed weight in a code also may hold a t-design. We first construct a class of linear codes from cyclic codes and determine the weight distribution of the linear codes. Then, we obtain infinite families of 2-designs from the supports of all the codewords with a fixed weight in these codes. Furthermore, the parameters of 2-designs are calculated explicitly.
报告人简介:杜小妮,西北师范大学教授、博士生导师,中国密码学会理事。2012年入选教育部“新世纪优秀人才计划”。 主持4项国家自然科学基金项目,人社部留学回国人员择优资助项目和甘肃省自然科学基金项目等多项省部级项目。
用户登录