A tight upper bound for the maximal length of MDS elliptic codes

讲座时间 Datetime: 2022年6月19日，星期日，   10:00-11:30

地点 Venue: 腾讯线上会议：918-165-012

 主持人 Host：张汉斌

报告人 Speaker:韩冬春 

单位 Affiliation:西南交通大学

报告摘要 Abstract:

Determining the maximal length of MDS codes with certain dimension has been an interesting research topic in coding theory. The objective of this talk is to derive an upper bound for the maximal length of MDS elliptic codes over Fq with dimension 3≤k≤(q-2√q+1)/10. For such a range of dimension k, our result improves an earlier bound of Munuera and gives an affirmative solution to the conjecture of Li, Wan, and Zhang. Most notably, the proposed upper bound is tight for odd k in the sense that it can be achieved by some well-designed MDS elliptic codes.