报告人：方伟军博士 (清华大学深圳国际研究生院)

时间：2020/11/2318:30-19:30

线上讲座，腾讯会议信息见下

会议 ID：900 203 080

报告摘要：In this talk, we first of all derive an improved and general upper bound on the code length of Singleton-optimal LRCs with minimum distance d=5,6. Secondly, we obtain a complete characterization for Singleton-optimal LRCs with r=2 and d=6. And then we construct three new Singleton-optimal LRCs with large code length via some special structures of projective plane. In the end, we employ the well-known line-point incidence matrix and Johnson bounds for constant weight codes to derive tighter upper bounds on the code length, and the maximal value of the length of Singleton-optimal LRCs for some specific q are also determined.

欢迎参加！

邀请人：季利均、汪馨