High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity
暂无分享,去创建一个
Or Meir | Shubhangi Saraf | Swastik Kopparty | Noga Ron-Zewi | Swastik Kopparty | Shubhangi Saraf | Or Meir | Noga Ron-Zewi
[1] 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.
[2] Carsten Lund,et al. Proof verification and the intractability of approximation problems , 1992, FOCS 1992.
[3] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[4] Atri Rudra,et al. On the Robust Testability of Product of Codes , 2005, Electron. Colloquium Comput. Complex..
[5] Madhu Sudan,et al. Small PCPs with Low Query Complexity , 2001, STACS.
[6] Eli Ben-Sasson,et al. Short PCPs with Polylog Query Complexity , 2008, SIAM J. Comput..
[7] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[8] Eli Ben-Sasson,et al. Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.
[9] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[10] Or Meir,et al. Locally Correctable and Testable Codes Approaching the Singleton Bound , 2014, Electron. Colloquium Comput. Complex..
[11] 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.
[12] Or Meir,et al. The tensor product of two good codes is not necessarily robustly testable , 2012, Inf. Process. Lett..
[13] Eli Ben-Sasson,et al. Towards lower bounds on locally testable codes via density arguments , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[14] Yehuda Lindell. Introduction to Coding Theory Lecture Notes , 2009 .
[15] Avi Wigderson,et al. Robust local testability of tensor products of LDPC codes ? , 2006 .
[16] Alan Guo,et al. New affine-invariant codes from lifting , 2012, ITCS '13.
[17] Eli Ben-Sasson,et al. Tensor Products of Weakly Smooth Codes are Robust , 2008, Theory Comput..
[18] E. Gilbert. A comparison of signalling alphabets , 1952 .
[19] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[20] Michael Viderman,et al. A combination of testability and decodability by tensor products , 2011, Random Struct. Algorithms.
[21] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[22] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[23] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[24] Paul Valiant,et al. The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.
[25] Oded Goldreich,et al. Bravely, Moderately: A Common Theme in Four Recent Works , 2011, Studies in Complexity and Cryptography.
[26] Irit Dinur,et al. Dense Locally Testable Codes Cannot Have Constant Rate and Distance , 2010, APPROX-RANDOM.
[27] Noga Alon,et al. A linear time erasure-resilient code with nearly optimal recovery , 1996, IEEE Trans. Inf. Theory.
[28] Omer Reingold,et al. Undirected connectivity in log-space , 2008, JACM.
[29] Or Meir,et al. Combinatorial construction of locally testable codes , 2008, SIAM J. Comput..
[30] Eli Ben-Sasson,et al. Composition of semi-LTCs by two-wise tensor products , 2009, computational complexity.
[31] Robust locally testable codes and products of codes , 2006 .