Locally decodable codes: A brief survey

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

Volumn 6639 LNCS, Issue , 2011, Pages 273-282

  Yekhanin, Sergey ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL COUNTERPART; CODEWORD; CODEWORD LENGTH; ERROR CORRECTING CODE; HIGH NOISE; LOCALLY-DECODABLE CODES; RECENT PROGRESS;

CRYPTOGRAPHY; SURVEYS;

DECODING;

EID: 79959312154     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20901-7_18     Document Type: Conference Paper

References (20)

1. Ben-Aroya, A., Efremenko, K., Ta-Shma, A.: Local list decoding with a constant number of queries. In: 51st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 715-722 (2010)
2. Ben-Aroya, A., Efremenko, K., Ta-Shma, A.: A note on amplifying the error-tolerance of locally decodable codes. In: Electronic Colloquium on Computational Complexity (ECCC), TR10-134 (2010)
3. Beaver, D., Feigenbaum, J.: Hiding instances in multioracle queries. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol. 415, pp. 37-48. Springer, Heidelberg (1990)
4. Dvir, Z., Gopalan, P., Yekhanin, S.: Matching vector codes. In: 51st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 705-714 (2010)
5. Efremenko, K.: 3-query locally decodable codes of subexponential length. In: 41st ACM Symposium on Theory of Computing (STOC), pp. 39-44 (2009)
6. Grolmusz, V.: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica 20, 71-86 (2000)
7. Itoh, T., Suzuki, Y.: New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems, 263-270 (2010)
8. Kopparty, S., Saraf, S., Yekhanin, S.: High-rate codes with sublinear-time decoding. In: 43nd ACM Symposium on Theory of Computing, STOC (2011)
9. Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: 32nd ACM Symposium on Theory of Computing (STOC), pp. 80-86 (2000)
10. Lipton, R.: Efficient checking of computations. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol. 415, pp. 207-215. Springer, Heidelberg (1990)
11. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1983)
12. Chee, Y.M., Feng, T., Ling, S., Wang, H., Zhang, L.: Query-efficient locally decodable codes of subexponential length. In: Electronic Colloquium on Computational Complexity (ECCC), TR10-173 (2010)
13. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam
14. Muller, D.E.: Application of boolean algebra to switching circuit design and to error detection. IEEE Transactions on Computers 3, 6-12 (1954)
15. Raghavendra, P.: A note on Yekhanin's locally decodable codes. In: Electronic Colloquium on Computational Complexity (ECCC), TR07-016 (2007)
16. Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. IEEE Transactions on Information Theory 4, 38-49 (1954)
17. Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. In: 39th ACM Symposium on Theory of Computing (STOC), pp. 537-546 (1999)
18. Saraf, S., Yekhanin, S.: Noisy interpolation of sparse polynomials, and applications. In: 29th IEEE Computational Complexity Conference, CCC (2011)
19. Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. Journal of the ACM 55, 1-16 (2008)
20. Yekhanin, S.: Locally decodable codes. Foundations and trends in Theoretical Computer Science (2010, to appear)