Tensor Products of Weakly Smooth Codes Are Robust
暂无分享,去创建一个
[1] Oded Goldreich,et al. Short Locally Testable Codes and Proofs (Survey) , 2005, Electron. Colloquium Comput. Complex..
[2] Atri Rudra,et al. On the Robust Testability of Product of Codes , 2005, Electron. Colloquium Comput. Complex..
[3] David Burshtein,et al. On the application of LDPC codes to arbitrary discrete-memoryless channels , 2003, IEEE Transactions on Information Theory.
[4] Avi Wigderson,et al. Robust local testability of tensor products of LDPC codes ? , 2006 .
[5] D. Spielman,et al. Expander codes , 1996 .
[6] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[7] Robust locally testable codes and products of codes , 2006 .
[8] R. Gallager. Information Theory and Reliable Communication , 1968 .
[9] Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.
[10] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[11] Paul Valiant,et al. The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.
[12] G. A. Margulis,et al. Explicit constructions of graphs without short cycles and low density codes , 1982, Comb..
[13] Or Meir,et al. Combinatorial construction of locally testable codes , 2008, SIAM J. Comput..
[14] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.