Binary Codes with Locality for Four Erasures

In this paper, codes with locality for four erasures are considered. An upper bound on the rate of codes with locality with sequential recovery from four erasures is derived. The rate bound derived here is field independent. An optimal construction for binary codes meeting this rate bound is also provided. The construction is based on regular graphs of girth $6$ and employs the sequential approach of locally recovering from multiple erasures. An extension of this construction that generates codes which can sequentially recover from five erasures is also presented.

[1]  Balaji Srinivasan Babu,et al.  Binary codes with locality for multiple erasures having short block length , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[2]  Itzhak Tamo,et al.  Bounds on the Parameters of Locally Recoverable Codes , 2015, IEEE Transactions on Information Theory.

[3]  Xin Wang,et al.  Some Improvements on Locally Repairable Codes , 2015, ArXiv.

[4]  Chau Yuen,et al.  Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance , 2015, ArXiv.

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

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

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

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

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

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

[11]  Hong-Yeop Song,et al.  Binary locally repairable codes from complete multipartite graphs , 2015, 2015 International Conference on Information and Communication Technology Convergence (ICTC).

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

[13]  Paul H. Siegel,et al.  Binary Linear Locally Repairable Codes , 2015, IEEE Transactions on Information Theory.

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

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

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

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

[18]  Fang-Wei Fu,et al.  On the Locality and Availability of Linear Codes Based on Finite Geometry , 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[19]  P. Vijay Kumar,et al.  Codes with local regeneration , 2012, 2013 IEEE International Symposium on Information Theory.

[20]  Chau Yuen,et al.  Binary Locally Repairable Codes - Sequential Repair for Multiple Erasures , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

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