学术活动

Constructions of maximally recoverable local reconstruction codes——金玲飞 副教授(复旦大学)

作者:   来源:  时间:2020-10-16

编码密码学术活动月系列活动四

 

题目:Constructions of maximally recoverable local reconstruction codes

报告人:金玲飞  副教授(复旦大学)

Abstract:

Local Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. They have emerged as the codes of choice for large scale distributed storage systems due to the very efficient repair of failed storage nodes in the typical scenario of a single or few nodes failing, while also offering fault tolerance against worst-case scenarios with more erasures. A maximally recoverable (MR) LRC offers the best possible blend of such local and global fault tolerance, guaranteeing recovery from all erasure patterns which are information-theoretically correctable given the presence of local recovery groups. In this talk, we intoduce an approach to construct MR LRCs. Our method recovers, and in most parameter regimes improves, the field size of previous approaches.

时间:2020年10月16日(周五) 下午16:00-17:00

地点:线上腾讯会议(会议号:622 964 073)

联系人:张俊

主办单位:首都师范大学数学科学学院

首都师范大学交叉科学研究院