A construction of maximally recoverable codes

08/19/2021

∙

by   Alexander Barg, et al.

∙

0

∙

share

We construct a family of linear maximally recoverable codes with locality r and dimension r+1. For codes of length n with r≈ n^α, 0≤α≤ 1 the code alphabet is of the order n^1+3α, which improves upon the previously known constructions of maximally recoverable codes.