Locally decodable codes

Foundations and Trends in Theoretical Computer Science

Volumn 6, Issue 3, 2010, Pages 139-255

  Yekhanin, Sergey ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-STRINGS; CODE-WORDS; CODEWORD; ERROR CORRECTING CODE; HIGH NOISE; LOCALLY-DECODABLE CODES; NOISY CHANNEL; TYPICAL APPLICATION;

ENCODING (SYMBOLS); INFORMATION THEORY;

DECODING;

EID: 78751499485     PISSN: 1551305X     EISSN: 15513068     Source Type: Journal    
DOI: 10.1561/0400000030     Document Type: Article

References (100)

1. N. Alon, "Eigenvalues, geometric expanders, sorting in rounds, amd Ramsey theory," Combinatorica, vol. 6, pp. 207-219, 1986.
2. N. Alon and J. Spencer, The Probabilistic Method. 2000.
3. A. Ambainis, "Upper bound on the communication complexity of private information retrieval," in International Colloquium on Automata, Languages and Programming (ICALP), vol. 1256 of Lecture Notes in Computer Science, pp. 401-407, 1997.
4. S. Arora and M. Sudan, "Improved low-degree testing and its applications," Combinatorica, vol. 23, pp. 365-426, 2003.
5. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, "Checking computations in polylogarithmic time," in ACM Symposium on Theory of Computing (STOC), pp. 21-31, 1991.
6. L. Babai and P. Frankl, Linear Algebra Methods in Combinatorics. 1998.
7. B. Barak, Z. Dvir, A. Wigderson, and A. Yehudayoff, "Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes," in ACM Symposium on Theory of Computing (STOC), 2011.
8. B. Barak, A. Rao, R. Shaltiel, and A. Wigderson, "2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction," in ACM Symposium on Theory of Computing (STOC), pp. 671-680, 2006.
9. O. Barkol, Y. Ishai, and E. Weinreb, "On locally decodable codes, selfcorrectable codes, and t-private PIR," in International Workshop on Randomization and Computation (RANDOM), pp. 311-325, 2007.
10. D. A. Barrington, R. Beigel, and S. Rudich, "Representing Boolean functions as polynomials modulo composite numbers," Computational Complexity, vol. 4, pp. 67-382, 1994.
11. D. Beaver and J. Feigenbaum, "Hiding instances in multioracle queries," in International Symposium on Theoretical Aspects of Computer Science (STACS), vol. 415 of Lecture Notes in Computer Science, pp. 37-48, 1990.
12. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, "Security with low communication overhead," in International Cryptology Conference (CRYPTO), pp. 62-76, 1990.
13. D. Beaver, S. Micali, and P. Rogaway, "The round complexity of secure protocols," in ACM Symposium on Theory of Computing (STOC), pp. 503-513, 1990.
14. A. Beimel, Y. Ishai, and E. Kushilevitz, "General constructions for information-theoretic private information retrieval," Journal of Computer and System Sciences, vol. 71, pp. 213-247, 2005.
15. A. Beimel, Y. Ishai, E. Kushilevitz, and J.-F. Raymond, "Breaking the O(n1/(2-1)) barrier for information-theoretic private information retrieval," in IEEE Symposium on Foundations of Computer Science (FOCS), pp. 261-270, 2002.
16. A. Beimel, Y. Ishai, and T. Malkin, "Reducing the servers' computation in private information retrieval: PIR with preprocessing," in International Cryptology Conference (CRYPTO), vol. 1880 of Lecture Notes in Computer Science, pp. 56-74, 2000.
17. A. Beimel and Y. Stahl, "Robust information theoretic private information retrieval," in Conference on Security in Communication Networks, 2002.
18. A. Ben-Aroya, K. Efremenko, and A. Ta-Shma, "Local list decoding with a constant number of queries," in IEEE Symposium on Foundations of Computer Science (FOCS), pp. 715-722, 2010.
19. A. Ben-Aroya, K. Efremenko, and A. Ta-Shma, "A note on amplifying the error-tolerance of locally decodable codes," in Electronic Colloquium on Computational Complexity (ECCC) TR10-134, 2010.
20. A. Ben-Aroya, O. Regev, and R. de Wolf, "A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs," in IEEE Symposium on Foundations of Computer Science (FOCS), pp. 477-486, 2008.
21. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," in ACM Symposium on Theory of Computing (STOC), pp. 1-10, 1988.
22. A. Bhattacharyya, Z. Dvir, S. Saraf, and A. Shpilka, "Tight lower bounds for 2-query LCCs over finite fields," in IEEE Symposium on Foundations of Computer Science (FOCS), pp. 638-647, 2011.
23. M. Blum and S. Kannan, "Designing programs that check their work," in ACM Symposium on Theory of Computing (STOC), pp. 86-97, 1989.
24. M. Blum, M. Luby, and R. Rubinfeld, "Self-testing/correcting with applications to numerical problems," Journal of Computer and System Sciences, vol. 47, pp. 549-595, 1993.
25. C. Cachin, S. Micali, and M. Stadler, "Computationally private information retrieval with polylogarithmic communication," in International Cryptology Conference (EUROCRYPT), vol. 1592 of Lecture Notes in Computer Science, pp. 402-414, 1999.
26. P. J. Cameron, Combinatorics: Topics, Techniques, Algorithms. 1994.
27. D. Chaum, C. Crepeau, and I. Damgard, "Multiparty unconditionally secure protocols," in ACM Symposium on Theory of Computing (STOC), pp. 11-19, 1988.
28. V. Chen, E. Grigorescu, and R. de Wolf, "Efficient and error-correcting data structures for membership and polynomial evaluation," in Symposium on Theoretical Aspects of Computer Science (STACS), 2010.
29. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, "Private information retrieval," Journal of the ACM, vol. 45, pp. 965-981, 1998.
30. R. de Wolf, "Error-correcting data structures," in Annual Symposium on Theoretical Aspects of Computer Science (STACS 09), pp. 313-324, 2009.
31. A. Deshpande, R. Jain, T. Kavitha, S. Lokam, and J. Radhakrishnan, "Better lower bounds for locally decodable codes," in IEEE Computational Complexity Conference (CCC), pp. 184-193, 2002.
32. G. Di-Crescenzo, Y. Ishai, and R. Ostrovsky, "Universal service-providers for private information retrieval," Journal of Cryptology, vol. 14, pp. 37-74, 2001.
33. A. Drucker and R. de Wolf, Quantum Proofs for Classical Theorems. Arxiv 0910.3376, 2009.
34. Z. Dvir, "On matrix rigidity and locally self-correctable codes," in IEEE Computational Complexity Conference (CCC), pp. 102-113, 2010.
35. Z. Dvir, P. Gopalan, and S. Yekhanin, "Matching vector codes," SIAM Journal on Computing, 2011. (to appear).
36. Z. Dvir, S. Kopparty, S. Saraf, and M. Sudan, "Extensions to the method of multiplicities, with applications to Kakeya sets and mergers," in IEEE Symposium on Foundations of Computer Science (FOCS), pp. 181-190, 2009.
37. Z. Dvir and A. Shpilka, "Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits," SIAM Journal on Computing, vol. 36, no. 5, pp. 1404-1434, 2006.
38. K. Efremenko, "3-query locally decodable codes of subexponential length," in ACM Symposium on Theory of Computing (STOC), pp. 39-44, 2009.
39. P. Elias, List Decoding for Noisy Channels. Research laboratory for electronics, MIT, 1957.
40. G. D. Forney, Concatenated Codes. Cambridge: MIT Press, 1966.
41. A. Gal and A. Mills, "Three query locally decodable codes with higher correctness require exponential length," in International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 673-684, 2011.
42. W. Gasarch, "A survey on private information retrieval," The Bulletin of the EATCS, vol. 82, pp. 72-107, 2004.
43. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson, "Self testing/correcting for polynomials and for approximate functions," in ACM Symposium on Theory of Computing (STOC), pp. 32-42, 1991.
44. P. Gemmell and M. Sudan, "Highly resilient correctors for polynomials," Information Processing Letters, vol. 43, pp. 169-174, 1992.
45. C. Gentry and Z. Ramzan, "Single-database private information retrieval with constant communication rate," in International Colloquium on Automata, Languages and Programming (ICALP), pp. 803-815, 2005.
46. Y. Gertner, S. Goldwasser, and T. Malkin, "A random server model for private information retrieval," in International Workshop on Randomization and Computation (RANDOM), vol. 1518 of Lecture Notes in Computer Science, pp. 200-217, 1998.
47. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, "Protecting data privacy in private information retrieval schemes," Journal of Computer and System Sciences, vol. 60, pp. 592-629, 2000.
48. O. Goldreich, H. Karloff, L. Schulman, and L. Trevisan, "Lower bounds for locally decodable codes and private information retrieval," in IEEE Computational Complexity Conference (CCC), pp. 175-183, 2002.
49. P. Gopalan, "Computing with polynomials over composites," PhD Thesis, Georgia Institute of Technology, 2006.
50. V. Grolmusz, "Constructing set-systems with prescribed intersection sizes," Journal of Algorithms, vol. 44, pp. 321-337, 2002.
51. V. Grolmusz, "Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs," Combinatorica, vol. 20, pp. 71-86, 2000.
52. V. Guruswami, "List decoding of error-correcting codes," PhD Thesis, Massachusetts Institite of Technology, 2001.
53. V. Guruswami and A. Rudra, "Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy," IEEE Transactions on Information Theory, vol. 54, pp. 135-150, 2008.
54. V. Guruswami, A. Sahai, and M. Sudan, "Soft-decision decoding of Chinese Remainder Codes," in Proceedings of the IEEE Symposium on Foundations of Computer Science, pp. 159-168, Redondo Beach, California, November 12-14 2000.
55. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometric codes," IEEE Transactions on Information Theory, vol. 45, pp. 1757-1767, 1999.
56. G. Hardy and E. Wright, An Introduction to the Theory of Numbers. Oxford: Clarendon Press, 1985.
57. A. Holevo, "Bounds for the quantity of information transmitted by a quantum communication channel," Problems of Information Transmission, vol. 9, pp. 177-183, 1973.
58. Y. Ishai and E. Kushilevitz, "On the hardness of information-theoretic multiparty computation," in Eurocrypt 2004, vol. 3027 of Lecture Notes in Computer Science, pp. 439-455, 2004.
59. T. Itoh and Y. Suzuki, "New constructions for query-efficient locally decodable codes of subexponential length," IEICE Transactions on Information and Systems, pp. 263-270, 2010.
60. J. Katz and L. Trevisan, "On the efficiency of local decoding procedures for error-correcting codes," in ACM Symposium on Theory of Computing (STOC), pp. 80-86, 2000.
61. K. S. Kedlaya and S. Yekhanin, "Locally decodable codes from nice subsets of finite fields and prime factors of Mersenne numbers," SIAM Journal on Computing, vol. 38, pp. 1952-1969, 2009.
62. I. Kerenidis and R. de Wolf, "Exponential lower bound for 2-query locally decodable codes via a quantum argument," Journal of Computer and System Sciences, vol. 69, pp. 395-420, 2004.
63. S. Kopparty, S. Saraf, and S. Yekhanin, "High-rate codes with sublineartime decoding," in ACM Symposium on Theory of Computing (STOC), pp. 167-176, 2011.
64. E. Kushilevitz and R. Ostrovsky, "Replication is not needed: Single-database computationally-private information retrieval," in IEEE Symposium on Foundations of Computer Science (FOCS), pp. 364-373, 1997.
65. R. Lidl and H. Niederreiter, Finite Fields. Cambridge: Cambridge University Press, 1983.
66. H. Lipmaa, "An oblivious transfer protocol with log-squared communication," Technical Report 2004/063, International Association for Cryptologic Research, 2004.
67. R. Lipton, "Efficient checking of computations," in International Symposium on Theoretical Aspects of Computer Science (STACS), vol. 415 of Lecture Notes in Computer Science, pp. 207-215, 1990.
68. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, New York: North Holland, 1977.
69. Y. Meng Chee, T. Feng, S. Ling, H. Wang, and L. Zhang, "Query-efficient locally decodable codes of subexponential length," in Electronic Colloquium on Computational Complexity (ECCC), TR10-173, 2010.
70. D. E. Muller, "Application of boolean algebra to switching circuit design and to error detection," IEEE Transactions on Computers, vol. 3, pp. 6-12, 1954.
71. M. Naor and B. Pinkas, "Oblivious transfer and polynomial evaluation," in ACM Symposium on Theory of Computing (STOC), pp. 245-254, 1999.
72. A. Nayak, "Optimal lower bounds for quantum automata and random access codes," in IEEE Symposium on Foundations of Computer Science (FOCS), pp. 369-377, 1999.
73. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information. Cambridge: Cambridge University Press, 2000.
74. K. Obata, "Optimal lower bounds for 2-query locally decodable linear codes," in International Workshop on Randomization and Computation (RANDOM), vol. 2483 of Lecture Notes in Computer Science, pp. 39-50, 2002.
75. R. Ostrovsky and V. Shoup, "Private information storage," in ACM Symposium on Theory of Computing (STOC), pp. 294-303, 1997.
76. F. Parvaresh and A. Vardy, "Correcting errors beyond the Guruswami-Sudan radius in polynomial time," in 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 285-294, 2005.
77. W. W. Peterson and E. J. Weldon Jr., Error Correcting Codes. 1972.
78. A. Polishchuk and D. Spielman, "Nearly-linear size holographic proofs," in ACM Symposium on Theory of Computing (STOC), pp. 194-203, 1994.
79. P. Raghavendra, "A note on Yekhanin's locally decodable codes," in Electronic Colloquium on Computational Complexity (ECCC), TR07-016, 2007.
80. A. Razborov and S. Yekhanin, "An Ω(n1/3) lower bound for bilinear group based private information retrieval," Theory of Computing, vol. 3, pp. 221-238, 2007.
81. I. S. Reed, "A class of multiple-error-correcting codes and the decoding scheme," IEEE Transactions on Information Theory, vol. 4, pp. 38-49, 1954.
82. A. Romashchenko, "Reliable computations based on locally decodable codes," in International Symposium on Theoretical Aspects of Computer Science (STACS), vol. 3884 of Lecture Notes in Computer Science, pp. 537-548, 2006.
83. M. Rozenbloom and M. Tsfasman, "Codes for the m-metric," Problems Information Transmission, vol. 33, pp. 45-52, 1997.
84. S. Saraf and M. Sudan, "Improved lower bound on the size of Kakeya sets over finite fields," Analysis and PDE, vol. 1, pp. 375-379, 2008.
85. S. Saraf and S. Yekhanin, "Noisy interpolation of sparse polynomials, and applications," in IEEE Computational Complexity Conference (CCC), 2011.
86. J. Sgall, "Bounds on pairs of families with restricted intersections," Combinatorica, vol. 19, pp. 555-566, 1999.
87. V. Shoup, A Computational Introduction to Number Theory and Algebra. Cambridge: Cambridge University Press, 2005.
88. M. Sudan, "Ideal error-correcting codes: Unifying algebraic and numbertheoretic algorithms," in AAECC, pp. 36-45, 2001.
89. M. Sudan, Personal Communication. 2009.
90. M. Sudan, L. Trevisan, and S. Vadhan, "Pseudorandom generators without the XOR lemma," in ACM Symposium on Theory of Computing (STOC), pp. 537-546, 1999.
91. G. Tardos and D. Barrington, "A lower bound of the mod 6 degree of the OR function," Computational Complexity, vol. 7, pp. 99-108, 1998.
92. L. Trevisan, Coding Theory and Complexity. Lecture Notes, 2003.
93. L. Trevisan, "Some applications of coding theory in computational complexity," Quaderni di Matematica, vol. 13, pp. 347-424, 2004.
94. S.Wehner and R. deWolf, "Improved lower bounds for locally decodable codes and private information retrieval," in International Colloquium on Automata, Languages and Programming (ICALP), vol. 3580 of Lecture Notes in Computer Science, pp. 1424-1436, 2005.
95. D. Woodruff, "New lower bounds for general locally decodable codes," in Electronic Colloquium on Computational Complexity (ECCC), TR07-006, 2007.
96. D. Woodruff, "A quadratic lower bound for three query linear locally decodable codes over any field," in International Workshop on Randomization and Computation (RANDOM), 2010.
97. D.Woodruff and S. Yekhanin, "A geometric approach to information theoretic private information retrieval," in IEEE Computational Complexity Conference (CCC), pp. 275-284, 2005.
98. C. Xing, "Nonlinear codes from algebraic curves improving the Tsfasman- Vladut-Zink bound," IEEE Transactions on Information Theory, vol. 49, pp. 1653-1657, 2003.
99. S. Yekhanin, "Towards 3-query locally decodable codes of subexponential length," Journal of the ACM, vol. 55, pp. 1-16, 2008.
100. S. Yekhanin, "Private information retrieval," Communications of the ACM, vol. 53, no. 4, pp. 68-73, 2010.