Locality via Partially Lifted Codes

In error-correcting codes, locality refers to several different ways of quantifying how easily a small amount of information can be recovered from encoded data. In this work, we study a notion of locality called the s-Disjoint-Repair-Group Property (s-DRGP). This notion can interpolate between two very different settings in coding theory: that of Locally Correctable Codes (LCCs) when s is large---a very strong guarantee---and Locally Recoverable Codes (LRCs) when s is small---a relatively weaker guarantee. This motivates the study of the s-DRGP for intermediate s, which is the focus of our paper. We construct codes in this parameter regime which have a higher rate than previously known codes. Our construction is based on a novel variant of the lifted codes of Guo, Kopparty and Sudan. Beyond the results on the s-DRGP, we hope that our construction is of independent interest, and will find uses elsewhere.

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

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

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

[4]  Eitan Yaakobi,et al.  Nearly optimal constructions of PIR and batch codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[5]  L. Litwin,et al.  Error control coding , 2001 .

[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]  E. F. Assmus POLYNOMIAL CODES AND FINITE GEOMETRIES , 2003 .

[8]  Eli Ben-Sasson,et al.  Limits on the Rate of Locally Testable Affine-Invariant Codes , 2011, APPROX-RANDOM.

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

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

[11]  Shubhangi Saraf,et al.  High-rate codes with sublinear-time decoding , 2014, Electron. Colloquium Comput. Complex..

[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]  Alan Guo,et al.  New affine-invariant codes from lifting , 2012, ITCS '13.

[15]  David P. Woodruff A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field , 2010, Journal of Computer Science and Technology.

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

[17]  GopiSivakanth,et al.  Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs , 2017 .

[18]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[19]  Or Meir,et al.  High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity , 2016, STOC.

[20]  David P. Woodruff A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field , 2010, APPROX-RANDOM.

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

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

[23]  Sergey Yekhanin Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..

[24]  Alexander Vardy,et al.  Lower Bound on the Redundancy of PIR Codes , 2016, ArXiv.

[25]  Arnab Bhattacharyya,et al.  Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs , 2015, ACM Trans. Comput. Theory.

[26]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[27]  Vitaly Skachek,et al.  Batch and PIR Codes and Their Connections to Locally-Repairable Codes , 2016, ArXiv.

[28]  Alexandros G. Dimakis,et al.  Repairable Fountain Codes , 2014, IEEE J. Sel. Areas Commun..

[29]  Alan Guo,et al.  List-Decoding Algorithms for Lifted Codes , 2016, IEEE Transactions on Information Theory.

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

[31]  Rafail Ostrovsky,et al.  Local Correctability of Expander Codes , 2013, ICALP.

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