New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
Authors:
- 7 June 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (2) , 889-899
Abstract
In recent literature, a family of optimal linear locally recoverable codes (LRC codes) that attain the maximum possible distance (given code length, cardinality, and locality) is presented. The key ingredient for constructing such optimal linear LRC codes is the so-called r-good polynomials, where r is equal to the locality of the LRC code. However, given a prime p, known constructions of r-good polynomials over some extension field of Fp exist only for some special integers r, and the problem of constructing optimal LRC codes over small field for any given locality is still open. In this paper, by using function composition, we present two general methods of designing good polynomials, which lead to three new constructions of r-good polynomials. Such polynomials bring new constructions of optimal LRC codes. In particular, our constructed polynomials as well as the power functions yield optimal (n, k, r) LRC codes over Fq for all positive integers r as localities, where q is near the code length n.Keywords
Funding Information
- National Key Basic Research Program of China (2013CB834204)
This publication has 21 references indexed in Scilit:
- Bounds on the Size of Locally Recoverable CodesIEEE Transactions on Information Theory, 2015
- An Efficient Binary Locally Repairable Code for Hadoop Distributed File SystemIEEE Communications Letters, 2014
- Binary cyclic codes that are locally repairable2014
- A Family of Optimal Locally Recoverable CodesIEEE Transactions on Information Theory, 2014
- Locally Repairable CodesIEEE Transactions on Information Theory, 2014
- Constructions of optimal and almost optimal locally repairable codes2014
- Optimal Locally Repairable Linear CodesIEEE Journal on Selected Areas in Communications, 2014
- Optimal locally repairable codes via rank-metric codes2013
- Optimal locally repairable codes and connections to matroid theory2013
- Explicit evaluation of certain exponential sums of binary quadratic functionsFinite Fields and Their Applications, 2007