【Seminar】"Locally recoverable codes from projective spaces"

Speaker

Pablo Sanchez Ocal, Postdoc of Speyer Unit (Representation Theory and Algebraic Combinatorics Unit)

Title

"Locally recoverable codes from projective spaces"

Abstract

A code is said to be locally recoverable when every symbol can be reconstructed from the others. Locally recoverable codes are extremely important for cloud storage applications, where often it is desirable to have more than one way of reconstructing a given symbol. In this talk I will present families of locally recoverable codes with multiple recovery sets constructed using projective spaces. These codes are straightforward to implement and have desirable practical properties: They enjoy a large minimum distance (even being optimal in certain cases) and an information rate close to the theoretical limit. These codes also have interesting theoretical properties: They form a family of asymptotically good codes, of which only two other examples are known. 

Arxiv link