报告题目：Minimum Distance of New Generalizations of the Punctured Binary RM Codes

报告人：冯克勤 教授 （清华大学）

摘要：Motivated by applications in combinatorial design theory and constructing LCD codes, C. Ding et al [2] introduced cyclic codes  and over Fq as new generalization and version of the punctured binary Reed-Muller codes. In this paper, we show several new results on minimum distance of  and  which are generalization or improvement of previous results given in [2]

  [1] Liqun Hu and Keqin Feng,Minimum distance of  new generalizations of the punctured binary Reed-Muller codes,2018

  [2] C.Ding,C.Li and Y.Xia, Another generalisation of the binary Reed-Muller codes and its applications, to appear in FFA,2018

报告时间：6月25日下午3:20-4:20

报告地点：首都师大新教2楼  827 教室