报告人：范翠玲 教授（西南交通大学）
报告时间：2022年10月11日(周二) 14：00-15：00
腾讯会议：718-987-315
报告摘要： The singleton bound states a realtionship among the parameters n,k,d of a linear code. Codes meeting the Singleton bound are called maximum distance seperable (MDS) codes. The MDS conjecture states that the code length of a MDS code is no more than q+2, thus in order to get good code with longer length, near maximum diatence seperable (NMDS) codes were introduced by slightly weaking the restrictions of MDS codes. This talk will introduce some basic properties of MDS codes and NMDS codes, the construcions of NMDS codes obtained from known MDS codes, and the applications of NMDS codes to construct both distance-optimal and dimensional-optimal locally recoverable codes.
邀请人：季利均 教授