{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T09:20:10Z","timestamp":1787390410897,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["735\/20"],"award-info":[{"award-number":["735\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451046","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1502-1515","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Efficient list-decoding with constant alphabet and list sizes"],"prefix":"10.1145","author":[{"given":"Zeyu","family":"Guo","sequence":"first","affiliation":[{"name":"University of Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noga","family":"Ron-Zewi","sequence":"additional","affiliation":[{"name":"University of Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160263"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034780"},{"key":"e_1_3_2_1_4_1","first-page":"633","article-title":"Error correction of algebraic block codes","volume":"4","author":"Berlekamp E. R.","year":"1987","unstructured":"E. R. Berlekamp and L. Welch. 1987. Error correction of algebraic block codes. US Patent Number 4,633,470.","journal-title":"US Patent Number"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.40"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214010"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"David Forney. 1966. Concatenated Codes. M.I.T. Press. https:\/\/doi.org\/10.4249\/scholarpedia.8374 10.4249\/scholarpedia.8374","DOI":"10.4249\/scholarpedia.8374"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0147"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850672"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society.","author":"Jeronimo Fernando Granha","year":"2020","unstructured":"Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, and Madhur Tulsiani. 2020. Unique Decoding of Explicit \\epsilon -balanced Codes Near the Gilbert-Varshamov Bound. In Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536420"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959942"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3169-1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3235586.3235590"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214009"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.134"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2014.09.003"},{"key":"e_1_3_2_1_25_1","first-page":"2020","article-title":"Optimal rate list decoding over bounded alphabets using algebraic-geometric codes","volume":"27","author":"Guruswami Venkatesan","year":"2020","unstructured":"Venkatesan Guruswami and Chaoping Xing. 2020. Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. Electronic Colloquium on Computational Complexity (ECCC), 27, 2020. Pages 172.","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M116149X"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.32157"},{"key":"e_1_3_2_1_28_1","first-page":"1","article-title":"On List Recovery of High-Rate Tensor Codes. In Proceedings of the 23rd International Conference on Randomization and Computation (RANDOM). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","volume":"68","author":"Kopparty Swastik","year":"2019","unstructured":"Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, and Shashwat Silas. 2019. On List Recovery of High-Rate Tensor Codes. In Proceedings of the 23rd International Conference on Randomization and Computation (RANDOM). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Pages 68:1\u201368:22.","journal-title":"Pages"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society. Pages 212\u2013223","author":"Kopparty Swastik","year":"2018","unstructured":"Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, and Mary Wootters. 2018. Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. In Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society. Pages 212\u2013223."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222080"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Serge Lang. 2002. Algebra. Springer. https:\/\/doi.org\/10.1007\/978-1-4613-0041-0 10.1007\/978-1-4613-0041-0","DOI":"10.1007\/978-1-4613-0041-0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00050"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057586"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174325"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.936173"},{"key":"e_1_3_2_1_37_1","volume-title":"Algebraic function fields and codes. 254","author":"Stichtenoth Henning","unstructured":"Henning Stichtenoth. 2009. Algebraic function fields and codes. 254, Springer Science & Business Media."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055408"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.25"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838377"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238187"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451046","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":43,"alternative-id":["10.1145\/3406325.3451046","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451046","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}