Three query locally decodable codes with higher correctness require exponential length

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 673-684

  Gál, Anna ^a   Mills, Andrew ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING ALGORITHM; ERROR CORRECTING CODE; ERROR-CORRECTING; HIGH PROBABILITY; LOCALLY-DECODABLE CODES; NON-BINARY CODES; NONLINEAR CODES; QUERY CONSTRUCTION;

ALGORITHMS; COMPUTER SCIENCE;

DECODING;

EID: 84880275189     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.673     Document Type: Conference Paper

References (21)

1. N. Alon, L. Babai and A. Itai: A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, Vol. 7, pp. 567-583, 1986.
2. A. Ben-Aroya, K. Efremenko, A. Ta-Shma: Local list-decoding with a constant number of queries. ECCC Report No. 47, 2010.
3. A. Ben-Aroya, O. Regev and R. de Wolf: A hypercontractive inequality for matrix valued functions with applications to quantum computing and LDCs. In Proceedings of FOCS 2008, pp. 477-486.
4. Z. Dvir: On matrix rigidity and locally self-correctable codes. ECCC Technical Report No. 134, 2009.
5. Z. Dvir, P. Gopalan, S. Yekhanin: Matching Vector Codes. In Proceedings of FOCS 2010, pp. 705-714.
6. Z. Dvir and A. Shpilka: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. In Proceedings of STOC 2005, pp. 592-601.
7. K. Efremenko: 3-query locally decodable codes of subexponential length. In Proceedings of STOC 2009, pp. 39-44.
8. O. Goldreich, H. Karloff, L. Schulman and L. Trevisan: Lower bounds for linear locally decodable codes and private information retrieval. Comput. Complex., 15(3):263-296, 2006.
9. J. Katz and L. Trevisan: On the efficiency of local decoding procedures for error-correcting codes. In Proceedings of STOC 2000, pp. 80-86.
10. I. Kerenidis and R. de Wolf: Exponential lower bound for 2-query locally decodable codes via a quantum argument. In Proceedings of STOC 2003, pp. 106-115.
11. P. Bro Miltersen: Cell probe complexity - a survey. In Advances In Data Structures Workshop, 1999.
12. K. Obata: Optimal lower bounds for 2-query locally decodable linear codes. In Proceedings of RANDOM 2002 pp. 39-50.
13. P. Raghavendra: A note on Yekhanin's locally decodable codes. ECCC TR07-016, 2007.
14. D. Shiowattana and S. V. Lokam: An optimal lower bound for 2-query locally decodable linear codes. Inf. Process. Lett., 97(6):244-250, 2006.
15. L. Trevisan: Some applications of coding theory in computational complexity. ECCC TR04-043, 2004.
16. S. Wehner and R. de Wolf: Improved lower bounds for locally decodable codes and private information retrieval. In Proceedings of ICALP 2005 Vol. 3580 of LNCS, pp. 1424-1436.
17. R. de Wolf: Error-correcting data structures In Proceedings of STACS 2009 pp. 313-324.
18. D. Woodruff: Some new lower bounds for general locally decodable codes. ECCC TR07-006, 2006.
19. D. Woodruff: Corruption and recovery-efficient locally decodable codes. In Proceedings of RANDOM 2008, pp. 584-595.
20. D. Woodruff: A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field. In Proceedings of RANDOM 2010.
21. S. Yekhanin: Towards 3-query locally decodable codes of subexponential length. In Proceedings of STOC 2007, pp. 266-274.