Robust local testability of tensor products of LDPC codes ?
暂无分享,去创建一个
[1] Atri Rudra,et al. On the Robust Testability of Product of Codes , 2005, Electron. Colloquium Comput. Complex..
[2] Paul Valiant,et al. The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.
[3] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[4] Eli Ben-Sasson,et al. Short PCPs verifiable in polylogarithmic time , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[5] Eli Ben-Sasson,et al. Robust locally testable codes and products of codes , 2004, Random Struct. Algorithms.
[6] Eli Ben-Sasson,et al. Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.
[7] Eli Ben-Sasson,et al. Some 3CNF properties are hard to test , 2003, STOC '03.
[8] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[9] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[10] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[11] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[12] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.