报告题目：Weights of a class of projective geometry codes
摘要：Linear codes are an important class of error-correcting codes and widely used in secret sharing schemes, combinational designs, authentication codes and so on. LetC(n-1,q) be the p-ary linear code generated by the rows of the incidence matrix of points and hyperplanes ofPG(n-1,q), withq=ps, s>0 andp prime. This is a special class of projective geometry codes. The weights ofC(n-1,q) have attracted a great many of research in recent years. Some previous results are as follows: the minimal weight ofC(n-1,q) isθn-1, whereθn=qn-1q-1; the second minimal weight ofC(n-1,q) is2qn-2; the third minimal weight ofC(2,p) is2p+1, withp prime andp≥11; the fourth minimum weight ofC(2,p) is3p-3, withp prime andp≥5. What are all the weights ofC(n-1,q)? This is what we focus on in this talk.
个人简介：麻常利河北师范大学数学科学学院教授，博士生导师。主要从事代数组合与编码理论方面的研究工作。与王仰贤、霍元极教授合作，出版学术专著一部《矩阵结合方案》,主持国家自然科学基金两项，参与国家自然科学基金项目七项。
报告时间：12月23日下午14:00-14:50
报告地点：西南交通大学犀浦校区7510
