Constructions of Locally Recoverable Codes Which are Optimal
Giacomo Micheli · IEEE Transactions on Information Theory · 2019
Let q be a prime power and Fqbe the finite field of size q. In this paper we provide a Galois theoretical framework that allows to produce good polynomials for the Tamo and Barg construction of optimal locally recoverable codes (LRC). Using our approach we construct new good polynomials and therefore optimal LRCs with new parameters. The existing theory of good polynomials fits entirely in our new framework. The key advantage of our method is that we do not need to rely on arithmetic properties of the pair (q, r), where r is the locality of the code.