腾讯会议 ID：964 623 155
邀请人：周海燕教授
摘要：Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. An optimal locally repairable code refers to a block code archiving this Singleton-type bound. Like classical MDS codes, optimal locally repairable codes have some very nice combinatorial structures. In this talks, we will make use of automorphism group of rational function fields and elliptic function fields to present several constructions of optimal locally repairable codes. We wrap up the talk with some open problems in this topic.