Achieving arbitrary locality and availability in binary codes

The ith coordinate of an [n, k] code is said to have locality r and availability t if there exist t disjoint groups, each containing at most r other coordinates that can together recover the value of the ith coordinate. This property is particularly useful for codes for distributed storage systems because it permits local repair of failed nodes and parallel access of hot data. In this paper, for any positive integers r and t, we construct a binary linear code of length equation which has locality r and availability t for all coordinates. Although it only achieves the trivial minimum distance (i.e. t + 1), its information rate attains equation, which is higher than that of the direct product code, the only known construction that can achieve arbitrary locality and availability.

[1]  Dimitris S. Papailiopoulos,et al.  Locally Repairable Codes , 2012, IEEE Transactions on Information Theory.

[2]  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).

[3]  Frédérique Oggier,et al.  Self-repairing homomorphic codes for distributed storage systems , 2010, 2011 Proceedings IEEE INFOCOM.

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

[5]  Frédérique E. Oggier,et al.  Locally repairable codes with multiple repair alternatives , 2013, 2013 IEEE International Symposium on Information Theory.

[6]  Itzhak Tamo,et al.  Bounds on locally recoverable codes with multiple recovering sets , 2014, 2014 IEEE International Symposium on Information Theory.

[7]  Zhifang Zhang,et al.  Repair Locality With Multiple Erasure Tolerance , 2014, IEEE Transactions on Information Theory.

[8]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[9]  Sriram Vishwanath,et al.  Cooperative local repair in distributed storage , 2014, 2014 48th Annual Conference on Information Sciences and Systems (CISS).

[10]  Dimitris S. Papailiopoulos,et al.  Optimal locally repairable codes and connections to matroid theory , 2013, 2013 IEEE International Symposium on Information Theory.

[11]  P. Vijay Kumar,et al.  Codes with locality for two erasures , 2014, 2014 IEEE International Symposium on Information Theory.

[12]  Dimitris S. Papailiopoulos,et al.  Locality and Availability in Distributed Storage , 2014, IEEE Transactions on Information Theory.

[13]  Dimitris S. Papailiopoulos,et al.  XORing Elephants: Novel Erasure Codes for Big Data , 2013, Proc. VLDB Endow..

[14]  Sergey Yekhanin,et al.  On the locality of codeword symbols in non-linear codes , 2013, Discret. Math..

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

[16]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[17]  Zhifang Zhang,et al.  Repair locality from a combinatorial perspective , 2014, 2014 IEEE International Symposium on Information Theory.

[18]  Zhifang Zhang,et al.  An Integer Programming-Based Bound for Locally Repairable Codes , 2014, IEEE Transactions on Information Theory.

[19]  A. Robert Calderbank,et al.  Binary cyclic codes that are locally repairable , 2014, 2014 IEEE International Symposium on Information Theory.

[20]  Cheng Huang,et al.  Erasure Coding in Windows Azure Storage , 2012, USENIX Annual Technical Conference.

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

[22]  Arya Mazumdar,et al.  An upper bound on the size of locally recoverable codes , 2013, 2013 International Symposium on Network Coding (NetCod).

[23]  Dimitris S. Papailiopoulos,et al.  Simple regenerating codes: Network coding for cloud storage , 2011, 2012 Proceedings IEEE INFOCOM.

[24]  P. Vijay Kumar,et al.  Optimal linear codes with a local-error-correction property , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[25]  Chau Yuen,et al.  Optimal Locally Repairable Linear Codes , 2014, IEEE Journal on Selected Areas in Communications.