学术报告
Optimal locally repairable codes via automorphism groups of elliptic curves——马立明副研究员（中国科学技术大学）
编码密码学术活动月系列活动四
题目：Optimal locally repairable codes via automorphism groups of elliptic curves
报告人：马立明 副研究员（中国科学技术大学）
Abstract：
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. A block code achieving this Singleton-type bound is referred to an optimal locally repairable code. Like classical MDS codes, optimal locally repairable codes have very nice combinatorial structures. In this talk, we will make use of automorphism groups of elliptic curves to present explicit constructions of optimal locally repairable codes. This is a joint work with Professor Chaoping Xing.
时间：2020年10月16日（周五） 下午15:00-16:00
地点：线上腾讯会议（会议号：622 964 073）
联系人：张俊
主办单位：首都师范大学77779193永利官网
首都师范大学交叉科学研究院
欢迎全体师生积极参加！
