A combination of testability and decodability by tensor products

Ben-Sasson and Sudan (RSA 2006) showed that taking the repeated tensor product of linear codes with very large distance results in codes that are locally testable. Due to the large distance requirement the associated tensor products could be applied only over sufficiently large fields.

[1]  Eli Ben-Sasson,et al.  Composition of semi-LTCs by two-wise tensor products , 2009, computational complexity.

[2]  Robust locally testable codes and products of codes , 2006 .

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

[4]  Shubhangi Saraf,et al.  High-rate codes with sublinear-time decoding , 2011, STOC '11.

[5]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

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

[7]  Eli Ben-Sasson,et al.  Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..

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

[9]  Or Meir,et al.  Combinatorial construction of locally testable codes , 2008, SIAM J. Comput..

[10]  Ron M. Roth,et al.  Introduction to Coding Theory , 2019, Discrete Mathematics.

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

[12]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

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

[14]  Michael Viderman,et al.  Locally Testable vs. Locally Decodable Codes , 2010, APPROX-RANDOM.

[15]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[16]  Daniel A. Spielman,et al.  Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.

[17]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[18]  Parikshit Gopalan,et al.  A note on Efremenko's Locally Decodable Codes , 2009, Electron. Colloquium Comput. Complex..

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

[20]  Eli Ben-Sasson,et al.  Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.

[21]  Noga Alon,et al.  Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.

[22]  D. Spielman,et al.  Expander codes , 1996 .

[23]  Shubhangi Saraf,et al.  Local list-decoding and testing of random linear codes from high error , 2010, STOC '10.

[24]  Klim Efremenko,et al.  3-Query Locally Decodable Codes of Subexponential Length , 2008 .

[25]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[26]  Eli Ben-Sasson,et al.  Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.

[27]  Oded Goldreich,et al.  Short Locally Testable Codes and Proofs , 2011, Studies in Complexity and Cryptography.

[28]  Ron M. Roth,et al.  Improved Nearly-MDS Expander Codes , 2006, IEEE Transactions on Information Theory.

[29]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

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

[31]  Eric Vigoda,et al.  Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting , 2007, FOCS.

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

[33]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[34]  Madhu Sudan,et al.  Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..

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

[36]  Prasad Raghavendra,et al.  List decoding tensor products and interleaved codes , 2008, STOC '09.

[37]  Madhu Sudan,et al.  Sparse Random Linear Codes are Locally Decodable and Testable , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

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

[39]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

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

[41]  Alexander Shen.  IP = SPACE: simplified proof , 1992, JACM.

[42]  Eli Ben-Sasson,et al.  Low Rate Is Insufficient for Local Testability , 2010, APPROX-RANDOM.

[43]  Oded Goldreich,et al.  Locally testable codes and PCPs of almost-linear length , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

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

[46]  Ran Raz,et al.  Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[47]  Christopher Umans,et al.  Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.

[48]  Oded Goldreich,et al.  Short Locally Testable Codes and Proofs (Survey) , 2005, Electron. Colloquium Comput. Complex..

[49]  Luca Trevisan,et al.  Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..

[50]  Or Meir,et al.  IP = PSPACE Using Error-Correcting Codes , 2013, SIAM J. Comput..

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

[52]  Omer Reingold,et al.  Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem , 2004, FOCS.

[53]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[54]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[55]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

[56]  Venkatesan Guruswami,et al.  Linear time encodable and list decodable codes , 2003, STOC '03.

[57]  J. Pachares.  A table of bias levels useful in radar detection problems , 1958, IRE Trans. Inf. Theory.