Matching vector codes

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 705-714

  Dvir, Zeev ^a   Gopalan, Parikshit ^b   Yekhanin, Sergey ^b  

^a PRINCETON UNIVERSITY   (United States)

^b MSR   (United States)

Author keywords

Locally decodable codes; Matching vectors; Reed Muller codes

Indexed keywords

BLOCK CODES; DECODING; FORWARD ERROR CORRECTION;

CODEWORD; CODEWORD LENGTH; HIGH PROBABILITY; LOCALLY-DECODABLE CODES; LOWER BOUNDS; MATCHING VECTORS; REED-MULLER CODES;

VECTORS;

EID: 78751499873     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.73     Document Type: Conference Paper

References (37)

1. Noga Alon. Eigenvalues, geometric expanders, sorting in rounds, amd Ramsey theory. Combinatorica, 6:207-219, 1986.
2. Laszlo Babai, Lance Fortnow, Leonid Levin, and Mario Szegedy. Checking computations in polylogarithmic time. In 23rd ACM Symposium on Theory of Computing (STOC), pages 21-31, 1991.
3. Laszlo Babai and Peter Frankl. Linear algebra methods in combinatorics. 1998.
4. Omer Barkol, Yuval Ishai, and Enav Weinreb. On locally decodable codes, self-correctable codes, and t-private PIR. In International Workshop on Randomization and Computation (RANDOM), pages 311-325, 2007.
5. Donald Beaver and Joan 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.
6. Amos Beimel, Yuval Ishai, and Eyal Kushilevitz. General constructions for information-theoretic private information retrieval. Journal of Computer and System Sciences, 71:213-247, 2005. (Pubitemid 40878949)
7. 1/(2k-1)) barrier for information-theoretic private information retrieval. In 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 261-270, 2002.
8. Avraham Ben-Aroya, Klim Efremenko, and Amnon Ta-Shma. Local list decoding with a constant number of queries. In Electronic Colloquium on Computational Complexity (ECCC), TR010-047, 2010.
9. Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. Private information retrieval. Journal of the ACM, 45:965-981, 1998.
10. Zeev Dvir. On matrix rigidity and locally self-correctable codes. In 26th IEEE Computational Complexity Conference (CCC), pages 102-113, 2010.
11. Zeev Dvir, Parikshit Gopalan, and Sergey Yekhanin. Matching vector codes. In Electronic Colloquium on Computational Complexity (ECCC), TR010-012, 2010.
12. Zeev Dvir and Amir Shpilka. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. SIAM Journal on Computing, 36(5):1404-1434, 2006.
13. Klim Efremenko. 3-query locally decodable codes of subexponential length. In 41st ACM Symposium on Theory of Computing (STOC), pages 39-44, 2009.
14. David Forney. Generalized minimum distance decoding. IEEE Transactions on Information Theory, 12:125-131, 1966.
15. Anna Gal and Andrew Mills. Three query locally decodable codes with higher correctness require exponential length. Manuscript, submitted, 2009.
16. William Gasarch. A survey on private information retrieval. The Bulletin of the EATCS, 82:72-107, 2004.
17. Oded Goldreich, Howard Karloff, Leonard Schulman, and Luca Trevisan. Lower bounds for locally decodable codes and private information retrieval. In 17th IEEE Computational Complexity Conference (CCC), pages 175-183, 2002.
18. Parikshit Gopalan. A note on Efremenko's locally decodable codes. Electronic Colloquium on Computational Complexity (ECCC) TR09-069, 2009.
19. Vince Grolmusz. Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica, 20:71-86, 2000.
20. Toshiya Itoh and Yasuhiro Suzuki. New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems, E93-D:263-270, 2010.
21. Jonathan Katz and Luca 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.
22. Kiran S. Kedlaya and Sergey Yekhanin. Locally decodable codes from nice subsets of finite fields and prime factors of Mersenne numbers. SIAM Journal on Computing, 38:1952-1969, 2009.
23. Iordanis Kerenidis and Ronald 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. Richard 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. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. North Holland, Amsterdam, New York, 1977.
26. Alexander Polishchuk and Daniel Spielman. Nearly-linear size holographic proofs. In 26th ACM Symposium on Theory of Computing (STOC), pages 194-203, 1994.
27. Prasad Raghavendra. A note on Yekhanin's locally decodable codes. In Electronic Colloquium on Computational Complexity (ECCC), TR07-016, 2007.
28. Jiri Sgall. Bounds on pairs of families with restricted intersections. Combinatorica, 19:555-566, 1999.
29. Madhu Sudan. Efficient checking of polynomials and proofs and the hardness of approximation problems. PhD thesis, University of California at Berkeley, 1992.
30. Madhu Sudan, Luca Trevisan, and Salil Vadhan. Pseudorandom generators without the XOR lemma. In 39th ACM Symposium on Theory of Computing (STOC), pages 537-546, 1999.
31. Luca Trevisan. Some applications of coding theory in computational complexity. Quaderni di Matematica, 13:347-424, 2004.
32. Stephanie Wehner and Ronald 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.
33. David Woodruff. New lower bounds for general locally decodable codes. In Electronic Colloquium on Computational Complexity (ECCC), TR07-006, 2007.
34. David Woodruff. Corruption and recovery-efficient locally decodable codes. In International Workshop on Randomization and Computation (RANDOM), pages 584-595, 2008.
35. David Woodruff and Sergey Yekhanin. A geometric approach to information theoretic private information retrieval. In 20th IEEE Computational Complexity Conference (CCC), pages 275-284, 2005.
36. Sergey Yekhanin. Towards 3-query locally decodable codes of subexponential length. Journal of the ACM, 55:1-16, 2008.
37. Sergey Yekhanin. Locally decodable codes. Foundations and trends in theoretical computer science, 2010. to appear.