An optimal lower bound for 2-query locally decodable linear codes

Information Processing Letters

Volumn 97, Issue 6, 2006, Pages 244-250

  Shiowattana, Dungjade ^a   Lokam, Satyanarayana V ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Combinatorial problems; Computational complexity; Cryptography

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; LINEAR SYSTEMS;

BOOLEAN CUBE; COMBINATORIAL PROBLEMS;

DATA PROCESSING;

EID: 31644447365     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.11.009     Document Type: Article

References (13)

1. A. Ambainis, Upper bound on communication complexity of private information retrieval, in: ICALP 1997, pp. 401-407
2. L. Babai, L. Fortnow, L.A. Levin, M. Szegedy, Checking computations in polylogarithmic time, in: STOC 1991, pp. 21-31
3. A. Beimel, Y. Ishai, Information-theoretic private information retrieval: A unified construction, in: ICALP 2001, pp. 912-926
4. 1/(2k-1)) barrier for information-theoretic private information retrieval, in: FOGS 2002, pp. 261-270
5. A. Deshpande, R. Jain, T. Kavitha, J. Radhakrishnan, S.V. Lokam, Better lower bounds for locally decodable codes, in: IEEE Conf. on Computational Complexity, 2002, pp. 184-193
6. O. Goldreich, H.J. Karloff, L.J. Schulman, and L. Trevisan Lower bounds for linear locally decodable codes and private information retrieval in: IEEE Conf. on Computational Complexity, 2002, pp. 175-183. See also the revised version of ECCC report TR01-080 at http://www.eccc.uni-trier.de/eccc-reports/ 2001/TR01-080/
7. J. Katz, L. Trevisan, On the efficiency of local decoding procedures for error-correcting codes, in: STOC 2000, pp. 80-86
8. I. Kerenidis, and R. de Wolf Exponential lower bound for 2-query locally decodable codes Electron. Colloquium Comput. Complexity 9 2002
9. C.-J. Lu, O. Reingold, S.P. Vadhan, A. Wigderson, Extractors: optimal up to constant factors, in: STOC 2003, pp. 602-611
10. N. Nisan, A. Wigderson, Hardness vs. randomness, in: FOGS 1988, pp. 2-11
11. K. Obata, Optimal lower bounds for 2-query locally decodable linear codes, in: RANDOM 2002, pp. 39-50
12. M. Sipser, and D.A. Spielman Expander codes IEEE Trans. Inform. Theory 42 1996 1710 1722
13. S. Wehner, and R. de Wolf Improved lower bounds for locally decodable codes and private information retrieval in: ICALP 05, in press. Preprint at http://arxiv.org/abs/quant-ph/0403140 2005