A construction of maximally recoverable codes

Abstract

We construct a family of linear maximally recoverable codes with locality $r$ and dimension $r+1.$ For codes of length $n$ with $r\approx n^{\hat{I}}\pm ,0\le \hat{I}\pm \le 1$ the code alphabet is of the order $n^{1+3\hat{I}\pm },$ which improves upon the previously known constructions of maximally recoverable codes.