Codes with hierarchical locality

In this paper, we study the notion of codes with hierarchical locality that is identified as another approach to local recovery from multiple erasures. The well-known class of codes with locality is said to possess hierarchical locality with a single level. In a code with two-level hierarchical locality, every symbol is protected by an inner-most local code, and another middle-level code of larger dimension containing the local code. We first consider codes with two levels of hierarchical locality, derive an upper bound on the minimum distance, and provide optimal code constructions of low field-size under certain parameter sets. Subsequently, we generalize both the bound and the constructions to hierarchical locality of arbitrary levels.

[1]  Ernst W. Biersack,et al.  A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

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

[3]  Zhen Huang,et al.  Reducing Repair Traffic in P2P Backup Systems: Exact Regenerating Codes on Hierarchical Codes , 2011, TOS.

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

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

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

[7]  Sriram Vishwanath,et al.  Error resilience in distributed storage via rank-metric codes , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[9]  P. Vijay Kumar,et al.  Codes With Local Regeneration and Erasure Correction , 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]  Zhifang Zhang,et al.  Repair Locality With Multiple Erasure Tolerance , 2014, IEEE Transactions on Information Theory.

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

[13]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

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