报告题目：The largest number of weights in cyclic codes

摘 要：Upper and lower bounds on the largest number of weights in a cyclic code ofgiven length, dimension and alphabet are given. An application to irreducible cycliccodes is considered. Sharper upper bounds are given for cyclic codes (called herestrongly cyclic), allcodewords of which have period the length. Asymptotics arederived on the function Γ(k,q), the largest number of nonzero weights a cyclic codeof dimension k over Fq can have, and an algorithm to compute it is sketched.

报 告 人：施敏加 教授， 安徽大学

报告时间：2018年9月12日（星期三）下午16:30-17:30

报告地点：扬州大学数学科学学院38号楼103报告厅

主办单位：扬州大学数学科学学院

欢迎广大师生参加！