报告题目：线性码的最小局部性

主 讲 人：周正春教授（西南交通大学）

报告时间：11月5日 8:00-9:00

报告地点：腾讯会议 ID：862 389 257

主办单位：002cc白菜资讯

报告摘要：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.

主讲人简介：周正春，西南交通大学教授、博士生导师、系统可信性自动验证国家地方联合工程实验室副主任、军委科技委重点项目组专家。一直致力于面向通信、雷达、数据降维、信息安全、电子对抗的序列编码和智能信息处理理论和技术研究，在领域权威期刊发表论文70余篇，先后完成30项国家级、省部级、国防和企业委托项目。入选国家“青年拔尖人才”，曾获全国百篇优秀博士论文获、教育部自然科学二等奖（2次）。设计的两类优相关低PAPR序列均入选下一代WIFI(WIFI 7)国际标准。