Locally Testable Codes Require Redundant Testers
暂无分享,去创建一个
Venkatesan Guruswami | Eli Ben-Sasson | Michael Viderman | Tali Kaufman | Madhu Sudan | M. Sudan | V. Guruswami | T. Kaufman | Eli Ben-Sasson | M. Viderman
[1] Noga Alon,et al. Construction Of Asymptotically Good Low-rate Error-correcting Codes Through Pseudo-random Graphs , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.
[2] 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).
[3] Avi Wigderson,et al. Robust local testability of tensor products of LDPC codes ? , 2006 .
[4] Or Meir. Combinatorial Construction of Locally Testable Codes , 2009, SIAM J. Comput..
[5] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[6] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[7] Madhu Sudan,et al. 2-Transitivity Is Insufficient for Local Testability , 2008, Computational Complexity Conference.
[8] Eli Ben-Sasson,et al. Low Rate Is Insufficient for Local Testability , 2010, APPROX-RANDOM.
[9] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[10] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[11] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[12] Paul Valiant,et al. The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.
[13] Simon Litsyn,et al. Upper bounds on the rate of LDPC codes as a function of minimum distance , 2002, IEEE Transactions on Information Theory.
[14] Eli Ben-Sasson,et al. Robust locally testable codes and products of codes , 2004, Random Struct. Algorithms.
[15] Eli Ben-Sasson,et al. Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.
[16] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[17] Oded Goldreich,et al. Short Locally Testable Codes and Proofs (Survey) , 2005, Electron. Colloquium Comput. Complex..
[18] Eli Ben-Sasson,et al. Some 3CNF properties are hard to test , 2003, STOC '03.
[19] László Babai,et al. Locally testable cyclic codes , 2005, IEEE Transactions on Information Theory.
[20] Eli Ben-Sasson,et al. Sound 3-Query PCPPs Are Long , 2008, TOCT.
[21] Venkatesan Guruswami,et al. Locally Testable Codes Require Redundant Testers , 2009, Computational Complexity Conference.
[22] Eli Ben-Sasson,et al. Bounds on 2-Query Codeword Testing , 2003, RANDOM-APPROX.
[23] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[24] Yehuda Lindell. Introduction to Coding Theory Lecture Notes , 2009 .
[25] Omer Reingold,et al. Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[26] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[27] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[28] Venkatesan Guruswami. On 2-Query Codeword Testing with Near-Perfect Completeness , 2006, ISAAC.