A combination of testability and decodability by tensor products

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7408 LNCS, Issue , 2012, Pages 651-662

  Viderman, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

efficient decoding; locally correctable codes; locally testable codes; Tensor products

Indexed keywords

CONSTANT RATE; LINEAR CODES; LINEAR TIME; LIST-DECODABLE CODES; LOCALLY CORRECTABLE CODES; LOCALLY TESTABLE CODES; RELATIVE DISTANCES; TENSOR PRODUCTS; TESTABILITY;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; DECODING;

TENSORS;

EID: 84865307689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32512-0_55     Document Type: Conference Paper

References (52)

1. Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.M.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory 38(2), 509 (1992)
2. Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing reed-muller codes. IEEE Transactions on Information Theory 51(11), 4032-4039 (2005)
3. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501-555 (1998)
4. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1), 70-122 (1998)
5. Arora, S., Sudan, M.: Improved low-degree testing and its applications. Combinatorica 23(3), 365-426 (2003)
6. Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proc. 23rd STOC, pp. 21-31. ACM (1991)
7. Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has twoprover interactive protocols. Computational Complexity 1, 3-40 (1991)
8. Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity 3, 307-318 (1993)
9. Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Robust PCPs of proximity, shorter PCPs, and applications to coding. SIAM Journal on Computing 36(4), 889-974 (2006)
10. Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3CNF Properties Are Hard to Test. SIAM Journal on Computing 35(1), 1-21 (2005)
11. Ben-Sasson, E., Sudan, M.: Simple PCPs with poly-log rate and query complexity. In: STOC, pp. 266-275. ACM (2005)
12. Ben-Sasson, E., Sudan, M.: Robust locally testable codes and products of codes. Random Struct. Algorithms 28(4), 387-402 (2006)
13. Ben-Sasson, E., Viderman, M.: Composition of Semi-LTCs by Two-Wise Tensor Products. In: Dinur, I., Jansen, K., Naor, J., Rolim, J.D.P. (eds.) APPROX and RANDOM 2009. LNCS, vol. 5687, pp. 378-391. Springer, Heidelberg (2009)
14. Ben-Sasson, E., Viderman, M.: Tensor Products of Weakly Smooth Codes are Robust. Theory of Computing 5(1), 239-255 (2009)
15. Ben-Sasson, E., Viderman, M.: Low Rate Is Insufficient for Local Testability. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J.D.P. (eds.) APPROX and RANDOM 2010, LNCS, vol. 6302, pp. 420-433. Springer, Heidelberg (2010)
16. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. JACM: Journal of the ACM 45 (1998)
17. Coppersmith, D., Rudra, A.: On the Robust Testability of Product of Codes. Electronic Colloquium on Computational Complexity (ECCC) (104) (2005)
18. Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM 54(3), 12:1-12:44 (2007)
19. Dinur, I., Reingold, O.: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM Journal on Computing 36(4), 975-1024 (2006)
20. Dinur, I., Sudan, M., Wigderson, A.: Robust Local Testability of Tensor Products of LDPC Codes. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX and RANDOM 2006. LNCS, vol. 4110, pp. 304-315. Springer, Heidelberg (2006)
21. Efremenko, K.: 3-query locally decodable codes of subexponential length. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31-June 2, pp. 39-44. ACM (2009)
22. Goldreich, O.: Short locally testable codes and proofs (survey). Electronic Colloquium on Computational Complexity (ECCC) (014) (2005)
23. Goldreich, O., Meir, O.: The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable. Electronic Colloquium on Computational Complexity (ECCC) 14(062) (2007)
24. Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost-linear length. Journal of the ACM 53(4), 558-655 (2006)
25. Gopalan, P., Guruswami, V., Raghavendra, P.: List decoding tensor products and interleaved codes. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31-June 2, pp. 13-22. ACM (2009)
26. Guruswami, V., Indyk, P.: Linear time encodable and list decodable codes. In: STOC, pp. 126-135. ACM (2003)
27. Guruswami, V., Indyk, P.: Linear-time encodable/decodable codes with nearoptimal rate. IEEE Transactions on Information Theory 51(10), 3393-3400 (2005)
28. Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: STOC, pp. 220-229 (1997)
29. Kaufman, T., Sudan, M.: Sparse random linear codes are locally decodable and testable. In: FOCS, pp. 590-600. IEEE Computer Society (2007)
30. Kaufman, T., Viderman, M.: Locally Testable vs. Locally Decodable Codes. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J.D.P. (eds.) APPROX And RANDOM 2010, LNCS, vol. 6302, pp. 670-682. Springer, Heidelberg (2010)
31. Kopparty, S., Saraf, S.: Local list-decoding and testing of random linear codes from high error. In: Schulman, L.J. (ed.) Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, June 5-8, pp. 417-426. ACM (2010)
32. Kopparty, S., Saraf, S., Yekhanin, S.: High-rate codes with sublinear-time decoding. ECCC - TR10-148 (2010)
33. Lipton, R.J.: Efficient Checking of Computations. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol. 415, pp. 207-215. Springer, Heidelberg (1990)
34. Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. Journal of the ACM 39(4), 859-868 (1992)
35. Blum, M., Luby, M., Rubinfeld, R.: Self-Testing/Correcting with Applications to Numerical Problems. JCSS: Journal of Computer and System Sciences 47 (1993)
36. Meir, O.: On the rectangle method in proofs of robustness of tensor products. Electronic Colloquium on Computational Complexity (ECCC) 14(061) (2007)
37. Meir, O.: Combinatorial Construction of Locally Testable Codes. SIAM J. Comput. 39(2), 491-544 (2009)
38. Meir, O.: IP = PSPACE using Error Correcting Codes. Electronic Colloquium on Computational Complexity (ECCC) 17, 137 (2010)
39. Moshkovitz, D., Raz, R.: Two-query PCP with subconstant error. J. ACM 57(5) (2010)
40. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP. In: STOC, pp. 475-484 (1997)
41. Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. IEEE Transactions on Information Theory 4(4), 38-49 (1954)
42. Roth, R.M.: Introduction to coding theory. Cambridge University Press (2006)
43. Roth, R.M., Skachek, V.: Improved Nearly-MDS Expander Codes. IEEE Transactions on Information Theory 52(8), 3650-3661 (2006)
44. Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM 52(2), 172-216 (2005)
45. Shamir, A.: IP = PSPACE. J. ACM 39(4), 869-877 (1992)
46. Shen, A.: IP = PSPACE: Simplified proof. J. ACM 39(4), 878-880 (1992)
47. Sipser, M., Spielman, D.A.: Expander Codes. IEEE Transactions on Information Theory 42(6), 1710-1722 (1996); Preliminary version appeared in FOCS 1994
48. Spielman, D.A.: Linear-time Encodable and Decodable Error-Correcting Codes. IEEE Transactions on Information Theory 42(6), 1723-1731 (1996); Preliminary version appeared in STOC 1995
49. Sudan, M., Trevisan, L., Vadhan, S.P.: Pseudorandom generators without the XOR lemma. J. Comput. Syst. Sci. 62(2), 236-266 (2001)
50. Trevisan, L.: Some applications of coding theory in computational complexity. Electronic Colloquium on Computational Complexity (ECCC) (043) (2004)
51. Valiant, P.: The Tensor Product of Two Codes Is Not Necessarily Robustly Testable. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and APPROX and RANDOM 2005. LNCS, vol. 3624, pp. 472-481. Springer, Heidelberg (2005)
52. Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. J. ACM 55(1) (2008)