High-rate codes with sublinear-time decoding

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 167-176

  Kopparty, Swastik ^a   Saraf, Shubhangi ^b   Yekhanin, Sergey ^c  

^a Institute of Advanced Study   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

derivatives; error correcting codes; locally decodable codes; multiplicity codes; polynomials; sublinear time algorithms

Indexed keywords

COMPUTATION THEORY; DECODING; DERIVATIVES; ERROR CORRECTION; MULTIVARIABLE SYSTEMS; POLYNOMIALS;

ASYMPTOTIC BEHAVIORS; DECODING ALGORITHM; DECODING TECHNIQUES; ERROR CORRECTING CODE; LOCALLY-DECODABLE CODES; MULTIPLICITY CODES; MULTIVARIATE POLYNOMIAL; SUBLINEAR TIME ALGORITHMS;

C (PROGRAMMING LANGUAGE);

EID: 79959688264     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993660     Document Type: Conference Paper

References (41)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, May 1998. (Pubitemid 128506634)
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, January 1998. (Pubitemid 128615465)
3. S. Arora and M. Sudan. Improved low-degree testing and its applications. Combinatorica, 23:365-426, 2003. (Pubitemid 38002511)
4. L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In 23rd ACM Symposium on Theory of Computing (STOC), pages 21-31, 1991.
5. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
6. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307-318, 1993.
7. D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In 7th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 415 of Lecture Notes in Computer Science, pages 37-48. Springer, Berlin, Heidelberg, 1990.
8. A. Ben-Aroya, K. Efremenko, and A. Ta-Shma. Local list decoding with a constant number of queries. In 51st IEEE Symposium on Foundations of Computer Science (FOCS), 2010.
9. Y. M. Chee, T. Feng, S. Ling, H. Wang, and L. F. Zhang. Query-efficient locally decodable codes of subexponential length. Arxiv 1008.1617, 2010.
10. A. Deshpande, R. Jain, T. Kavitha, S. Lokam, and J. Radhakrishnan. Better lower bounds for locally decodable codes. In 20th IEEE Computational Complexity Conference (CCC), pages 184-193, 2002.
11. Z. Dvir. On matrix rigidity and locally self-correctable codes. In 26th IEEE Computational Complexity Conference (CCC), pages 102-113, 2010.
12. Z. Dvir, P. Gopalan, and S. Yekhanin. Matching vector codes. In 51st IEEE Symposium on Foundations of Computer Science (FOCS), 2010.
13. Z. Dvir, S. Kopparty, S. Saraf, and M. Sudan. Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. In 50th IEEE Symposium on Foundations of Computer Science (FOCS), pages 181-190, 2009.
14. K. Efremenko. 3-query locally decodable codes of subexponential length. In 41st ACM Symposium on Theory of Computing (STOC), pages 39-44, 2009.
15. O. Goldreich, H. Karloff, L. Schulman, and L. Trevisan. Lower bounds for locally decodable codes and private information retrieval. In 17th IEEE Computational Complexity Conference (CCC), pages 175-183, 2002.
16. V. Guruswami and A. Rudra. Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy. IEEE Transactions on Information Theory, 54(1):135-150, 2008.
17. V. Guruswami, A. Sahai, and M. Sudan. Soft-decision decoding of Chinese Remainder codes. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pages 159-168, Redondo Beach, California, 12-14 November 2000.
18. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45:1757-1767, 1999. (Pubitemid 32871911)
19. J. W. P. Hirschfeld, G. Korchmaros, and F. Torres. Algebraic Curves over a Finite Field (Princeton Series in Applied Mathematics). Princeton University Press, 2008.
20. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR Lemma. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 220-229, May 1997.
21. T. Itoh and Y. Suzuki. New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems, pages 263-270, 2010.
22. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In 32nd ACM Symposium on Theory of Computing (STOC), pages 80-86, 2000.
23. I. Kerenidis and R. de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. Journal of Computer and System Sciences, 69:395-420, 2004.
24. R. Lipton. Efficient checking of computations. In 7th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 415 of Lecture Notes in Computer Science, pages 207-215. Springer, Berlin, Heidelberg, 1990.
25. C. Lund, L. Fortnow, H. J. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39(4):859-868, October 1992. (Pubitemid 23600385)
26. K. Obata. Optimal lower bounds for 2-query locally decodable linear codes. In 6th International Workshop on Randomization and Computation (RANDOM), volume 2483 of Lecture Notes in Computer Science, pages 39-50. Springer, Berlin, Heidelberg, 2002.
27. F. Parvaresh and A. Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In 46th IEEE Symposium on Foundations of Computer Science (FOCS), pages 285-294, 2005.
28. P. Raghavendra. A note on Yekhanin's locally decodable codes. In Electronic Colloquium on Computational Complexity (ECCC), TR07-016, 2007.
29. I. S. Reed. A class of multiple-error-correcting codes and the decoding scheme. IEEE Transactions on Information Theory, 4:38-49, 1954.
30. M. Rozenbloom and M. Tsfasman. Codes for the m-metric. Problems Inform. Transmission, 33:45-52, 1997.
31. S. Saraf and M. Sudan. Improved lower bound on the size of Kakeya sets over finite fields. Analysis and PDE, 2008.
32. R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM, 52(2):172-216, 2005.
33. A. Shamir. IP = PSPACE. Journal of the ACM, 39(4):869-877, October 1992. (Pubitemid 23600384)
34. M. Sudan. Ideal error-correcting codes: Unifying algebraic and number-theoretic algorithms. In AAECC, pages 36-45, 2001.
35. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. In 39th ACM Symposium on Theory of Computing (STOC), pages 537-546, 1999.
36. S. Wehner and R. de Wolf. Improved lower bounds for locally decodable codes and private information retrieval. In 32nd International Colloquium on Automata, Languages and Programming (ICALP), volume 3580 of Lecture Notes in Computer Science, pages 1424-1436. Springer, Berlin, Heidelberg, 2005.
37. D. Woodruff. New lower bounds for general locally decodable codes. In Electronic Colloquium on Computational Complexity (ECCC), TR07-006, 2007.
38. D. Woodruff and S. Yekhanin. A geometric approach to information theoretic private information retrieval. In 20th IEEE Computational Complexity Conference (CCC), pages 275-284, 2005.
39. C. Xing. Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound. IEEE Transactions on Information Theory, 49(7):1653-1657, 2003.
40. S. Yekhanin. Towards 3-query locally decodable codes of subexponential length. Journal of the ACM, 55:1-16, 2008.
41. S. Yekhanin. Locally decodable codes. Foundations and trends in theoretical computer science, 2010. to appear.