High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity

In this work, we construct the first locally-correctable codes (LCCs), and locally-testable codes (LTCs) with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist LCCs and LTCs with block length n, constant rate (which can even be taken arbitrarily close to 1) and constant relative distance, whose query complexity is exp(Õ(√logn)) (for LCCs) and (logn)O(loglogn) (for LTCs). Previously such codes were known to exist only with Ω(nβ) query complexity (for constant β>0). In addition to having small query complexity, our codes also achieve better trade-offs between the rate and the relative distance than were previously known to be achievable by LCCs or LTCs. Specifically, over large (but constant size) alphabet, our codes approach the Singleton bound, that is, they have almost the best-possible relationship between their rate and distance. This has the surprising consequence that asking for a large-alphabet error-correcting code to further be an LCC or LTC with sub-polynomial query complexity does not require any sacrifice in terms of rate and distance! Over the binary alphabet, our codes meet the Zyablov bound. Such trade-offs between the rate and the relative distance were previously not known for any o(n) query complexity. Our results on LCCs also immediately give locally-decodable codes (LDCs) with the same parameters. Our codes are based on a technique of Alon, Edmonds and Luby. We observe that this technique can be used as a general distance-amplification method, and show that it interacts well with local correctors and testers. We obtain our main results by applying this method to suitably constructed LCCs and LTCs in the non-standard regime of sub-constant relative distance.

[1]  Or Meir,et al.  High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity , 2017, J. ACM.

[2]  David P. Woodruff New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..

[3]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[4]  Eli Ben-Sasson,et al.  Tensor Products of Weakly Smooth Codes are Robust , 2008, Theory Comput..

[5]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.

[6]  Atri Rudra,et al.  On the Robust Testability of Product of Codes , 2005, Electron. Colloquium Comput. Complex..

[7]  Avi Wigderson,et al.  Robust local testability of tensor products of LDPC codes ? , 2006 .

[8]  Venkatesan Guruswami,et al.  Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.

[9]  E. Gilbert A comparison of signalling alphabets , 1952 .

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

[11]  Sergey Yekhanin,et al.  Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers , 2009, SIAM J. Comput..

[12]  Or Meir,et al.  The tensor product of two good codes is not necessarily robustly testable , 2012, Inf. Process. Lett..

[13]  Or Meir,et al.  On the rectangle method in proofs of robustness of tensor products , 2012, Inf. Process. Lett..

[14]  Michael Viderman,et al.  Strong LTCs with Inverse Polylogarithmic Rate and Soundness , 2013, 2013 IEEE Conference on Computational Complexity.

[15]  Or Meir Combinatorial Construction of Locally Testable Codes , 2009, SIAM J. Comput..

[16]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[17]  Eli Ben-Sasson,et al.  Short PCPs with Polylog Query Complexity , 2008, SIAM J. Comput..

[18]  Paul Valiant,et al.  The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.

[19]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[20]  G. David Forney,et al.  Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.

[21]  Noga Alon,et al.  Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[22]  Madhu Sudan,et al.  Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[23]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[24]  Swastik Kopparty List-Decoding Multiplicity Codes , 2012, Theory Comput..

[25]  Oded Goldreich,et al.  Bravely, Moderately: A Common Theme in Four Recent Works , 2011, Studies in Complexity and Cryptography.

[26]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

[27]  Eli Ben-Sasson,et al.  Robust locally testable codes and products of codes , 2004, Random Struct. Algorithms.

[28]  Oded Goldreich,et al.  Locally testable codes and PCPs of almost-linear length , 2006, JACM.

[29]  Luca Trevisan,et al.  List-decoding using the XOR lemma , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[30]  Or Meir,et al.  Locally Correctable and Testable Codes Approaching the Singleton Bound , 2014, Electron. Colloquium Comput. Complex..

[31]  Klim Efremenko 3-Query Locally Decodable Codes of Subexponential Length , 2012, SIAM J. Comput..

[32]  Prasad Raghavendra,et al.  A Note on Yekhanin's Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..

[33]  Michael Viderman Strong LTCs with Inverse Poly-Log Rate and Constant Soundness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[34]  Venkatesan Guruswami,et al.  Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.

[35]  Rafail Ostrovsky,et al.  Local correctability of expander codes , 2013, Inf. Comput..

[36]  Ronald de Wolf,et al.  Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval , 2004, ICALP.

[37]  Sergey Yekhanin,et al.  Towards 3-query locally decodable codes of subexponential length , 2008, JACM.

[38]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[39]  Eli Ben-Sasson,et al.  Composition of Semi-LTCs by Two-Wise Tensor Products , 2009, APPROX-RANDOM.

[40]  Alan Guo,et al.  New affine-invariant codes from lifting , 2012, ITCS '13.

[41]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[42]  Venkatesan Guruswami,et al.  Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.

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

[44]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[45]  Noam Nisan,et al.  BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[46]  Irit Dinur,et al.  Dense Locally Testable Codes Cannot Have Constant Rate and Distance , 2010, APPROX-RANDOM.

[47]  Noga Alon,et al.  A linear time erasure-resilient code with nearly optimal recovery , 1996, IEEE Trans. Inf. Theory.

[48]  Michael Viderman,et al.  Strong LTCs with Inverse Poly-Log Rate and Constant Soundness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

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

[50]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[51]  Richard C. Singleton,et al.  Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[52]  Richard J. Lipton,et al.  Efficient Checking of Computations , 1990, STACS.

[53]  Brett Hemenway,et al.  Linear-Time List Recovery of High-Rate Expander Codes , 2015, ICALP.

[54]  Michael Viderman,et al.  A Note on high-rate Locally Testable Codes with sublinear query complexity , 2010, Electron. Colloquium Comput. Complex..

[55]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[56]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[57]  Yehuda Lindell Introduction to Coding Theory Lecture Notes , 2009 .

[58]  Or Meir,et al.  High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity , 2015, Electron. Colloquium Comput. Complex..

[59]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[60]  Michael Viderman A Combination of Testability and Decodability by Tensor Products , 2012, APPROX-RANDOM.

[61]  Eli Ben-Sasson,et al.  Towards lower bounds on locally testable codes via density arguments , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[62]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[63]  J. Dodziuk Difference equations, isoperimetric inequality and transience of certain random walks , 1984 .

[64]  Oded Goldreich,et al.  A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem , 1997, SIAM J. Comput..

[65]  Swastik Kopparty Some remarks on multiplicity codes , 2013, Discrete Geometry and Algebraic Combinatorics.

[66]  Luca Trevisan,et al.  Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..

[67]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[68]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.