报告题目：Some results on Singleton-optimal locally repairable codes based on finite geometry
主讲人：陶然
报告时间：2024年5月19日11:20-11:50
报告地点：西安电子科技大学南校区网安大楼12楼A-1236
主讲人介绍：
陶然，山东大学网络空间安全学院助理研究员，硕士生导师。2021年博士毕业于浙江大学数学科学学院，导师为冯涛教授。目前主要从事代数组合与编码理论的研究工作，相关研究成果发表在Science China Mathematics，IEEE Transactions on Information Theory，Finite Fields and Their Applications，中国科学：数学等期刊上。
报告主要观点：
An 
-locally repairable code (LRC) is called a Singleton-optimal LRC if it achieves the Singleton-type bound. Analogous to the classical MDS conjecture, the maximal length problem of Singleton-optimal LRCs has attracted a lot of attention in recent years. In this talk, we will first present an improved upper bound for the length of 
-ary Singleton-optimal LRCs with disjoint repair groups. Additionally, we will provide several constructions of Singleton-optimal LRCs with some specific minimum distances 
and localities 
based on finite geometric structures.
