一、报告题目

Nonlinear Repair Schemes of Reed-Solomon Codes

二、主讲人

Itzhak Tamo

三、报告时间

2022年6月2日14：30-15：30

四、报告地点

腾讯会议ID : 830 1038 6343

五、摘要

The problem of repairing linear codes, and in particular, Reed Solomon (RS) codes, has attracted a lot of attention in recent years due to its importance in distributed storage systems. In this problem, a failed code symbol (node) needs to be repaired by downloading as little information as possible from a subset of the remaining nodes. There are examples of RS codes with efficient repair schemes, and some are even optimal. However, these schemes fall short in several aspects; for example, they require a considerable field extension degree, and in particular, they do not work over prime fields. In this work, we explore the power of nonlinear repair schemes of RS codes and show that such schemes are crucial over prime fields, and in some cases, they outperform all linear schemes. No prior knowledge of coding theory will be assumed. Based on joint work with Roni Con.

六、主讲人简介

Itzhak Tamo is a Senior Lecturer with the Electrical Engineering Department, Tel-Aviv University, Israel. His research interests include storage systems and devices, coding, information theory, and combinatorics. He was a co-recipient (with Zhiying Wang and Jehoshua Bruck) of the IEEE Communication Society Data Storage Technical Committee 2013 Best Paper Award. He received the 2015 IEEE Information Theory Society Paper Award along with A. Barg. In 2018, he received the Krill Prize. Currently, he serves as an associated editor for IEEE TRANSACTIONS ON INFORMATION THEORY.

七、主办单位

非线性期望前沿科学中心

数学与交叉科学研究中心