Lower bounds for adaptive locally decodable codes

Random Structures and Algorithms

Volumn 27, Issue 3, 2005, Pages 358-378

  Deshpande, Amit ^a   Jain, Rahul ^b   Kavitha, T ^c   Lokam, Satyanarayana V ^d   Radhakrishnan, Jaikumar ^e,f  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d UNIVERSITY OF MICHIGAN   (United States)

^e TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^f TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27844508564     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20069     Document Type: Conference Paper

References (20)

1. 358-378 [1] A. Amabainis, Upper bounds on the communication complexity of private information retrieval, Proc ICALP, 1997, pp. 401-407.
2. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking computations in poly-logartithmic time, Proc 23rd ACM Symp Theory of Computing (STOC), 1991, pp. 21-31.
3. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson, BPP has subexponential time simulations unless EXP-TIME has publishable proofs, Comput Complexity 3(4) (1993), 370-318.
4. A. Beimel and Y. Ishai, Information-theoretic private information retrieval: A unified Construction, ICALP 2001, pp. 912-926.
5. 1/(2k-1)) barrier for information theoretic Private Information Retrieval, Proc 43rd IEEE FOCS, 2002, pp. 261-270.
6. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private Information Retrieval, J ACM 45(6) (1998).
7. A. Deshpande, R. Jain, T. Kavitha, S. V. Lokam, and J. Radhakrishnan, Better bounds for locally decodable codes, IEEE Conf Computational Complexity, 2002, pp. 184-193.
8. P. Gemmel, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson, Self-testing/correcting for polynomials and for approximate functions, Proc 23rd STOC, 1991, pp. 32-42.
9. P. Gemmel and M. Sudan, Highly resilient correctors for polynomials, Inform process Lett 43(4) (1992), 169-174.
10. O. Goldreich, Personal Communication, cited in [12].
11. O. Goldreich, H. Karloff, L. Schulman, and L. Trevisan, Lower bounds for linear locally decodable codes and Private Information Retrieval, IEEE Conf Computational Complexity, 2002, 175-183.
12. J. Katz and L. Trevisan, On the efficiency of local decoding procedures for error-correcting codes, Proc 32nd ACM Symp Theory of Computing (STOC), 2000, pp. 80-86.
13. I. Kerendis and R. De Wolf, Exponential lower bound for 2-query locally decodable codes via a quantum argument, Proc 35th STOC, 2003, 106-115.
14. C. J. Lu, O. Reingold, S. Vadhan, and A. Wigderson, Extractors: Optimal up to constant factors, Proc 35th STOC, 2003 pp. 602-611.
15. E. Mann, Private access to distributed information, Master's Thesis, Technion, Haifa, Israel, 1998.
16. K. Obata, Optimal lower bounds for 2-query locally decodable linear codes, Proc 6th RANDOM, 2002, pp. 39-50.
17. A. Polishchuk and D.A. Spielman, Nearly linear-size holographic proofs, Proc 26th ACM STOC, 1994, pp. 194-203.
18. D. Shiowattana and S. V. Lokam, An optimal lower bound for 2-query locally decodable linear codes, October 2004, submitted.
19. M. Sipser and D. A. Spielman, Expander codes IEEE Trans Inform Theory 42 (1996), 1710-1722.
20. M. Sudan, L. Trevisan, and S. Vadhan, Pseudo-random generators without the XOR Lemma, Proc 31st STOC, 1999, pp. 537-546.