{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:06Z","timestamp":1760202606539,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642209000"},{"type":"electronic","value":"9783642209017"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20901-7_18","type":"book-chapter","created":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T10:11:30Z","timestamp":1307182290000},"page":"273-282","source":"Crossref","is-referenced-by-count":5,"title":["Locally Decodable Codes: A Brief Survey"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Yekhanin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013722 (2010)","DOI":"10.1109\/FOCS.2010.88"},{"key":"18_CR2","unstructured":"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)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-52282-4_30","volume-title":"STACS 90","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Feigenbaum, J.: Hiding instances in multioracle queries. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol.\u00a0415, pp. 37\u201348. Springer, Heidelberg (1990)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Dvir, Z., Gopalan, P., Yekhanin, S.: Matching vector codes. In: 51st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 705\u2013714 (2010)","DOI":"10.1109\/FOCS.2010.73"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Efremenko, K.: 3-query locally decodable codes of subexponential length. In: 41st ACM Symposium on Theory of Computing (STOC), pp. 39\u201344 (2009)","DOI":"10.1145\/1536414.1536422"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s004930070032","volume":"20","author":"V. Grolmusz","year":"2000","unstructured":"Grolmusz, V.: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica\u00a020, 71\u201386 (2000)","journal-title":"Combinatorica"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Itoh, T., Suzuki, Y.: New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems, 263\u2013270 (2010)","DOI":"10.1587\/transinf.E93.D.263"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Kopparty, S., Saraf, S., Yekhanin, S.: High-rate codes with sublinear-time decoding. In: 43nd ACM Symposium on Theory of Computing, STOC (2011)","DOI":"10.1145\/1993636.1993660"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"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\u201386 (2000)","DOI":"10.1145\/335305.335315"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-52282-4_44","volume-title":"STACS 90","author":"R. Lipton","year":"1990","unstructured":"Lipton, R.: Efficient checking of computations. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol.\u00a0415, pp. 207\u2013215. Springer, Heidelberg (1990)"},{"key":"18_CR11","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1983)"},{"key":"18_CR12","unstructured":"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)"},{"key":"18_CR13","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam"},{"key":"18_CR14","first-page":"6","volume":"3","author":"D.E. Muller","year":"1954","unstructured":"Muller, D.E.: Application of boolean algebra to switching circuit design and to error detection. IEEE Transactions on Computers\u00a03, 6\u201312 (1954)","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR15","unstructured":"Raghavendra, P.: A note on Yekhanin\u2019s locally decodable codes. In: Electronic Colloquium on Computational Complexity (ECCC), TR07-016 (2007)"},{"key":"18_CR16","first-page":"38","volume":"4","author":"I.S. Reed","year":"1954","unstructured":"Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. IEEE Transactions on Information Theory\u00a04, 38\u201349 (1954)","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. In: 39th ACM Symposium on Theory of Computing (STOC), pp. 537\u2013546 (1999)","DOI":"10.1145\/301250.301397"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Saraf, S., Yekhanin, S.: Noisy interpolation of sparse polynomials, and applications. In: 29th IEEE Computational Complexity Conference, CCC (2011)","DOI":"10.1109\/CCC.2011.38"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1326554.1326555","volume":"55","author":"S. Yekhanin","year":"2008","unstructured":"Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. Journal of the ACM\u00a055, 1\u201316 (2008)","journal-title":"Journal of the ACM"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Yekhanin, S.: Locally decodable codes. Foundations and trends in Theoretical Computer Science (2010, to appear)","DOI":"10.1007\/978-3-642-20712-9_22"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20901-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:06:00Z","timestamp":1558296360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20901-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642209000","9783642209017"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20901-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}