Optimal lower bounds for 2-query locally decodable linear codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2483, Issue , 2002, Pages 39-50

  Obata, Kenji ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; INFORMATION THEORY; RANDOM PROCESSES;

CODEWORD; CONSTANT FACTORS; LINEAR CODES; LOWER BOUNDS; OPTIMAL LOWER BOUND; PRIVATE INFORMATION RETRIEVAL; SCHULMAN;

CODES (SYMBOLS);

EID: 84959056761     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45726-7_4     Document Type: Conference Paper

References (3)

1. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. Journal of the ACM, 45 (6): 965-982, 1998.
2. O. Goldreich, H. Karloff, L. Schulman, and Luca Trevisan. Lower bounds for linear locally decodable codes and private information retrieval. In Proc. of the 17th IEEE CCC, 2002.
3. J. Katz and Luca Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proc. of the 32nd ACM STOC, 2000.