Maximally recoverable codes: The bounded case

Modern distributed storage systems employ Maximally Recoverable codes that aim to balance failure recovery capabilities with encoding/decoding efficiency tradeoffs. Recent works of Gopalan et al [SODA 2017] and Kane et al [FOCS 2017] show that the alphabet size of grid-like topologies of practical interest must be large, a feature that hampers decoding efficiency. To bypass such shortcomings, in this work we initiate the study of a weaker version of recoverability, where instead of being able to correct all correctable erasure patterns (as is the case for maximal recoverability), we only require to correct all erasure patterns of bounded size. The study of this notion reduces to a variant of a combinatorial problem studied in the literature, which is interesting in its own right. We study the alphabet size of codes withstanding all erasure patterns of small (constant) size. We believe the questions we propose are relevant to both real storage systems and combinatorial analysis, and merit further study.

[1]  Satyanarayana V. Lokam,et al.  Weight enumerators and higher support weights of maximally recoverable codes , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[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]  Ethan L. Miller,et al.  Screaming fast Galois field arithmetic using intel SIMD instructions , 2013, FAST.

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

[5]  Tuvi Etzion,et al.  PIR Array Codes with Optimal PIR Rate , 2016, ArXiv.

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

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

[8]  Balaji Srinivasan Babu,et al.  On partial maximally-recoverable and maximally-recoverable codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[9]  Yunnan Wu,et al.  A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.

[10]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[11]  Guangda Hu,et al.  New constructions of SD and MR codes over small finite fields , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[12]  Alexandros G. Dimakis,et al.  Batch codes through dense graphs without short cycles , 2014, 2015 IEEE International Symposium on Information Theory (ISIT).

[13]  Simeon Ball,et al.  On sets of vectors of a finite vector space in which every subset of basis size is a basis II , 2012, Designs, Codes and Cryptography.

[14]  Shachar Lovett,et al.  The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[15]  P. Vijay Kumar,et al.  Codes With Local Regeneration and Erasure Correction , 2014, IEEE Transactions on Information Theory.

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

[17]  Cory Hill,et al.  f4: Facebook's Warm BLOB Storage System , 2014, OSDI.

[18]  Eitan Yaakobi,et al.  Codes for distributed PIR with low storage overhead , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[19]  Rafail Ostrovsky,et al.  Batch codes and their applications , 2004, STOC '04.

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

[21]  Itzhak Tamo,et al.  A family of optimal locally recoverable codes , 2014, ISIT.

[22]  Shubhangi Saraf,et al.  Maximally Recoverable Codes for Grid-like Topologies , 2016, SODA.

[23]  Tuvi Etzion,et al.  PIR array codes with optimal PIR rates , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[24]  Minghua Chen,et al.  On the Maximally Recoverable Property for Multi-Protection Group Codes , 2007, 2007 IEEE International Symposium on Information Theory.

[25]  Rudolf Lide,et al.  Finite fields , 1983 .

[26]  Sergey Yekhanin,et al.  Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..

[27]  Jan De Beule,et al.  On sets of vectors of a finite vector space in which every subset of basis size is a basis II , 2012, Des. Codes Cryptogr..

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

[29]  Cheng Huang,et al.  Explicit Maximally Recoverable Codes With Locality , 2013, IEEE Transactions on Information Theory.

[30]  Mario Blaum,et al.  Partial-MDS Codes and Their Application to RAID Type of Architectures , 2012, IEEE Transactions on Information Theory.

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