Section: New Results

Locally correctable codes

Participant : Julien Lavauzelle.

In 2013, Guo, Kopparty and Sudan built a new family of locally correctable codes from lifting, achieving an arbitrarily high information rate for sublinear locality. J. Lavauzelle proposed an analogue of this construction in projective spaces [7]. The parameters of this construction are similar to the original work of Guo et al. Intertwined relations between the two families of codes were proven thanks to a careful analysis of their monomial bases. The practicality of the construction was also established through an implementation and a study of information sets and automorphisms of the code.