Linearized Reed-Solomon (LRS) codes are a class of evaluation codes based on skew polynomials. They achieve the Singleton bound in sum-rank metric, which arises in problems of communication over multiplicative-additive matrix channels. In this talk, I will first introduce linearized Reed-Solomon codes and their maximum sum-rank distance seperable (MSRD) property, after reviewing the related properties of skew polynomials, then introduce their applications in distributed storage systems (DSS) as a class of maximally recoverable-locally repairable codes (MR-LRCs).     «

Linearized Reed-Solomon (LRS) codes are a class of evaluation codes based on skew polynomials. They achieve the Singleton bound in sum-rank metric, which arises in problems of communication over multiplicative-additive matrix channels. In this talk, I will first introduce linearized Reed-Solomon codes and their maximum sum-rank distance seperable (MSRD) property, after reviewing the related properties of skew polynomials, then introduce their applications in distributed storage systems (DSS) as...     »