Improved lower bounds for locally decodable codes and private information retrieval

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1424-1436

  Wehner, Stephanie ^a   De Wolf, Ronald ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ENCODING (SYMBOLS); INFORMATION RETRIEVAL; USER INTERFACES;

DECODABLE CODES; LOWER BOUNDS; QUANTUM SUPERPOSITION;

CODES (SYMBOLS);

EID: 26444620133     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_115     Document Type: Conference Paper

References (15)

1. A. Ambainis. Upper bound on communication complexity of private information retrieval. In Proceedings of the 24th ICALP, volume 1256 of Lecture Notes in Computer Science, pages 401-407, 1997.
2. A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani. Dense quantum coding and a lower bound for 1-way quantum automata. In Proceedings of 31st ACM STOC, pages 697-704, 1999.
3. L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proceedings of 23rd ACM STOC, pages 21-31, 1991.
4. A. Beimel and Y. Ishai. Information-theoretic private information retrieval: A unified construction. In Proceedings of 28th ICALP, pages 912-926, 2001.
5. A. Beimel, Y. Ishai, and E. Kushilevitz. General constructions for informationtheoretical Private Information Retrieval. Manuscript, available on Amos Beimel's homepage. Includes [4], 2004.
6. 1/(2k-1)) barrier for information-theoretic Private Information Retrieval. In Proceedings of 43rd IEEE FOCS, pages 261-270, 2002.
7. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. Journal of the ACM, 45(6):965-981, 1998. Earlier version in FOCS'95.
8. O. Goldreich, H. Karloff, L. Schulman, and L. Trevisan. Lower bounds for linear locally decodable codes and private information retrieval. In Proceedings of 17th IEEE Conference on Computational Complexity, pages 175-183, 2002.
9. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge Univ. Press, 1985.
10. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for errorcorrecting codes. In Proceedings of 32nd ACM STOC, pages 80-86, 2000.
11. I. Kerenidis. Quantum multiparty communication complexity and circuit lower bounds. Apr 12, 2005. quant-ph/0504087.
12. I. Kerenidis and R. de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. Journal of Computer and Systems Sciences, 69(3):395-420, 2004. Earlier version in STOC'03. quant-ph/0208062.
13. E. Mann. Private access to distributed information. Master's thesis, Technion - Israel Institute of Technology, Haifa, 1998.
14. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In Proceedings of 40th IEEE FOCS, pages 369-376, 1999. quant-ph/9904093.
15. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.