Optimal (2,δ) Locally Repairable Codes via Punctured Simplex Codes
share
Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal (2, δ)-LRCs. Firstly, by the techniques of finite geometry, we present a sufficient condition to guarantee a punctured simplex code to be a (2, δ)-LRC. Secondly, by using characteristic sums over finite fields and Krawtchouk polynomials, we construct several families of LRCs with new parameters. All of our new LRCs are optimal with respect to the generalized Cadambe-Mazumdar bound.
READ FULL TEXT