主 讲 人：周正春教授（西南交通大学）
报告地点：腾讯会议 ID：862 389 257
报告摘要：Locally recoverable codes were proposed for the recovery of data in distributed and cloud storage systems. In the past decade, a lot of progress on the study of locally recoverable codes has been made. Despite of the good progress made by now, there is a lack of general theory on the minimum linear locality of linear codes. In addition, the minimum linear locality of many known families of linear codes are not studied in the literature. Motivated by these two facts, this talk report a general theory about the minimum linear locality of linear codes, and investigates the minimum linear locality of several families of linear codes. The minimum linear locality of many families of linear codes are settled with the proposed general theory.