On the maximal length of MDS elliptic codes
报告题目：On the maximal length of MDS elliptic codes
报告专家：韩冬春（西南交通大学）
报告时间：2023年6月27日，15:30-16:20，
报告地点：数学学院东409
报告摘要：Determining the maximal length of MDS codes with certain dimension is one of the central topics in coding theory and finite geometries. The MDS Main Conjecture states that the maximal length of a non-trivial q-ary MDS code of dimension k is q+1 except when q is even and k=3 or k=q-1. In this talk we will show that the maximal length of q-ary MDS elliptic codes is close to q/2, which proves a conjecture of Li, Wan, and Zhang. Moreover we will give an application of our result to subset sums in finite abelian groups.
邀请人：许宾