{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:04:18Z","timestamp":1775282658943,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214009","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"339-350","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Folded codes from function field towers and improved optimal rate list decoding"],"prefix":"10.1145","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"TR11-139","author":"Dvir Z.","year":"2011","unstructured":"Z. Dvir and S. Lovett . Subspace-evasive sets. Electronic Colloquium on Computational Complexity , TR11-139 , 2011 . Z. Dvir and S. Lovett. Subspace-evasive sets. Electronic Colloquium on Computational Complexity, TR11-139, 2011."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01884295"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0147"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.2140\/ant.2010.4.433"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2013878.2014014"},{"key":"e_1_3_2_2_7_1","volume-title":"Combinatorial limitations of a strong form of list decoding. CoRR, abs\/1202.6086","author":"Guruswami V.","year":"2012","unstructured":"V. Guruswami and S. Narayanan . Combinatorial limitations of a strong form of list decoding. CoRR, abs\/1202.6086 , 2012 . V. Guruswami and S. Narayanan. Combinatorial limitations of a strong form of list decoding. CoRR, abs\/1202.6086, 2012."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033252.2033304"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.179365"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.945244"},{"key":"e_1_3_2_2_14_1","volume-title":"Algebraic Function Fields and Codes. Universitext","author":"Stichtenoth H.","year":"1993","unstructured":"H. Stichtenoth . Algebraic Function Fields and Codes. Universitext , Springer-Verlag , Berlin , 1993 . H. Stichtenoth. Algebraic Function Fields and Codes. Universitext, Springer-Verlag, Berlin, 1993."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"e_1_3_2_2_16_1","volume-title":"Foundations and Trends in Theoretical Computer Science (FnT-TCS)","author":"Vadhan S.","year":"2010","unstructured":"S. Vadhan . Pseudorandomness. Foundations and Trends in Theoretical Computer Science (FnT-TCS) . NOW publishers, 2010 . To appear. Draft available at http:\/\/people.seas.harvard.edu\/~salil\/pseudorandomness\/. S. Vadhan. Pseudorandomness. Foundations and Trends in Theoretical Computer Science (FnT-TCS). NOW publishers, 2010. To appear. Draft available at http:\/\/people.seas.harvard.edu\/~salil\/pseudorandomness\/."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214009","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":16,"alternative-id":["10.1145\/2213977.2214009","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214009","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}