Explicit optimal-length locally repairable codes of distance 5

Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs oer the ideal trade-o between minimum distance and locality, a measure of the cost of repairing a single codeword symbol. For optimal LRCs with minimum distance greater than or equal to 5, block length is bounded by a polynomial function of alphabet size. In this paper, we give explicit constructions of optimal-length (in terms of alphabet size), optimal LRCs with minimum distance equal to 5.

[1]  Gretchen L. Matthews,et al.  Affine Cartesian codes with complementary duals , 2018, Finite Fields Their Appl..

[2]  Rafael H. Villarreal,et al.  Affine cartesian codes , 2012, Designs, Codes and Cryptography.

[3]  Chaoping Xing,et al.  Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields , 2020, IEEE Transactions on Information Theory.

[4]  Zhang ZhiFang,et al.  Constructions of optimal locally repairable codes over small fields , 2017 .

[5]  Chaoping Xing,et al.  Optimal Locally Repairable Codes Via Elliptic Curves , 2017, IEEE Transactions on Information Theory.

[6]  Olav Geil,et al.  Weighted Reed–Muller codes revisited , 2011, Des. Codes Cryptogr..

[7]  Lingfei Jin,et al.  Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes , 2018, IEEE Transactions on Information Theory.

[8]  Cícero Carvalho,et al.  On the next-to-minimal weight of affine cartesian codes , 2017, Finite Fields Their Appl..

[9]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[10]  Yuan Luo,et al.  Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes , 2019, IEEE Transactions on Information Theory.

[11]  Cheng Huang,et al.  On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.

[12]  Venkatesan Guruswami,et al.  How Long Can Optimal Locally Repairable Codes Be? , 2019, IEEE Transactions on Information Theory.

[13]  Simeon Ball ON LARGE SUBSETS OF A FINITE VECTOR SPACE IN WHICH EVERY SUBSET OF BASIS SIZE IS A BASIS , 2010 .

[14]  Minghua Chen,et al.  Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[15]  Itzhak Tamo,et al.  A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.

[16]  Sriram Vishwanath,et al.  Optimal locally repairable codes via rank-metric codes , 2013, 2013 IEEE International Symposium on Information Theory.

[17]  W. Marsden I and J , 2012 .

[18]  Gretchen L. Matthews,et al.  Locally recoverable codes from algebraic curves and surfaces , 2017, ArXiv.

[19]  Peter Beelen,et al.  Generalized Hamming weights of affine Cartesian codes , 2017, Finite Fields Their Appl..