Nonlinear Repair Schemes of Reed-Solomon Codes

Abstract: The problem repairing linear codes, particularly Reed Solomon(RS) codes, has attracted a lot for 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 fixed 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 what such schemes are crucial over prime fields , and in some cases , they outperform all linear schemes , based on joint work with Roni Con

DATE : 28March 2023

TIME: 15h00
VENUE: Kopanong (B2Lab207/209),Department of Electrical and Electronic Engineering Science APK UJ