A Combination of Testability and Decodability by Tensor Products
暂无分享,去创建一个
[1] Eli Ben-Sasson,et al. Composition of Semi-LTCs by Two-Wise Tensor Products , 2009, APPROX-RANDOM.
[2] Eli Ben-Sasson,et al. Tensor Products of Weakly Smooth Codes are Robust , 2008, Theory Comput..
[3] Eli Ben-Sasson,et al. Composition of semi-LTCs by two-wise tensor products , 2009, computational complexity.
[4] Or Meir,et al. IP = PSPACE Using Error-Correcting Codes , 2013, SIAM J. Comput..
[5] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[6] Avi Wigderson,et al. Robust local testability of tensor products of LDPC codes ? , 2006 .
[7] Venkatesan Guruswami,et al. Linear time encodable and list decodable codes , 2003, STOC '03.
[8] Or Meir,et al. The tensor product of two good codes is not necessarily robustly testable , 2012, Inf. Process. Lett..
[9] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[10] Prasad Raghavendra,et al. List decoding tensor products and interleaved codes , 2008, STOC '09.
[11] 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).
[12] Oded Goldreich,et al. Short Locally Testable Codes and Proofs (Survey) , 2005, Electron. Colloquium Comput. Complex..
[13] Eli Ben-Sasson,et al. Some 3CNF properties are hard to test , 2003, STOC '03.
[14] Luca Trevisan,et al. Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..
[15] Eli Ben-Sasson,et al. Robust locally testable codes and products of codes , 2004, Random Struct. Algorithms.
[16] Or Meir,et al. Combinatorial construction of locally testable codes , 2008, SIAM J. Comput..
[17] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2014, Electron. Colloquium Comput. Complex..
[18] Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.
[19] Paul Valiant,et al. The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.
[20] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2011, STOC '11.
[21] Eli Ben-Sasson,et al. Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.
[22] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[23] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[24] Shubhangi Saraf,et al. Local list-decoding and testing of random linear codes from high error , 2010, STOC '10.
[25] Eli Ben-Sasson,et al. Low Rate Is Insufficient for Local Testability , 2010, APPROX-RANDOM.
[26] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[27] Atri Rudra,et al. On the Robust Testability of Product of Codes , 2005, Electron. Colloquium Comput. Complex..
[28] Or Meir. Combinatorial Construction of Locally Testable Codes , 2009, SIAM J. Comput..
[29] Omer Reingold,et al. Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[30] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.