{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:47:35Z","timestamp":1764175655609,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Microsoft Research","award":["PhD Fellowship"],"award-info":[{"award-number":["PhD Fellowship"]}]},{"name":"National Science Foundation","award":["DMS-1953807"],"award-info":[{"award-number":["DMS-1953807"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649651","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"740-751","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["AG Codes Achieve List Decoding Capacity over Constant-Sized Fields"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4149-7298","authenticated-orcid":false,"given":"Joshua","family":"Brakensiek","sequence":"first","affiliation":[{"name":"Independent Researcher, N\/A, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5570-7116","authenticated-orcid":false,"given":"Manik","family":"Dhar","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9706-4171","authenticated-orcid":false,"given":"Sivakanth","family":"Gopi","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5393-514X","authenticated-orcid":false,"given":"Zihan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Ohio State University, Columbus, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Omar Alrabiah Venkatesan Guruswami and Ray Li. 2023. AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. arXiv preprint arXiv:2308.13424.","DOI":"10.1109\/TIT.2024.3405392"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Omar Alrabiah Venkatesan Guruswami and Ray Li. 2023. Randomly punctured Reed\u2013Solomon codes achieve list-decoding capacity over linear-sized fields. arXiv preprint arXiv:2304.09445.","DOI":"10.1145\/3618260.3649634"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Joshua Brakensiek Manik Dhar and Sivakanth Gopi. 2023. Generalized GM-MDS: Polynomial Codes are Higher Order MDS. arXiv preprint arXiv:2310.12888.","DOI":"10.1145\/3618260.3649637"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206952"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Joshua Brakensiek Manik Dhar Sivakanth Gopi and Zihan Zhang. 2023. AG codes achieve list decoding capacity over constant-sized fields. arXiv e-prints arXiv\u20132310.","DOI":"10.1145\/3618260.3649651"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3187366"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Joshua Brakensiek Sivakanth Gopi and Visu Makam. 2023. Generic Reed-Solomon codes achieve list-decoding capacity. 1488\u20131501.","DOI":"10.1145\/3564246.3585128"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2005.03.003"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"e_1_3_2_1_10_1","volume-title":"Algebraic geometry codes and some applications. ArXiv, abs\/2009.01281","author":"Couvreur Alain","year":"2020","unstructured":"Alain Couvreur and Hugues Randriambololona. 2020. Algebraic geometry codes and some applications. ArXiv, abs\/2009.01281 (2020), https:\/\/api.semanticscholar.org\/CorpusID:221669565"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875141"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214010"},{"key":"e_1_3_2_1_13_1","volume-title":"List Decoding for Noisy Channels. In IRE WESCON Convention Record","author":"Elias P","year":"1957","unstructured":"P Elias. 1957. List Decoding for Noisy Channels. In IRE WESCON Convention Record, 1957. 2, 94\u2013104."},{"volume-title":"Rank codes","author":"Gabidulin Ernst M","key":"e_1_3_2_1_14_1","unstructured":"Ernst M Gabidulin. 2021. Rank codes. TUM. University Press."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0147"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Eitan Goldberg Chong Shangguan and Itzhak Tamo. 2022. Singleton-type bounds for list-decoding and list-recovery and related results. 2565\u20132570. https:\/\/doi.org\/10.1109\/ISIT50566.2022.9834849 10.1109\/ISIT50566.2022.9834849","DOI":"10.1109\/ISIT50566.2022.9834849"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.136"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.136"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451046"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"e_1_3_2_1_23_1","unstructured":"Venkatesan Guruswami Atri Rudra and Madhu Sudan. 2012. Essential coding theory. Draft available at http:\/\/www. cse. buffalo. edu\/ atri\/courses\/coding-theory\/book."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214009"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3506668"},{"key":"e_1_3_2_1_27_1","volume-title":"Erasure Coding in Windows Azure Storage. In 2012 USENIX Annual Technical Conference","author":"Huang Cheng","year":"2012","unstructured":"Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, and Sergey Yekhanin. 2012. Erasure Coding in Windows Azure Storage. In 2012 USENIX Annual Technical Conference, Boston, MA, USA, June 13-15, 2012, Gernot Heiser and Wilson C. Hsieh (Eds.). USENIX Association, 15\u201326. https:\/\/www.usenix.org\/conference\/atc12\/technical-sessions\/presentation\/huang"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00029"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323345"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3194521"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384295"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.4153\/S0008439522000625"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Yongge Tian. 2019. Formulas for calculating the dimensions of the sums and the intersections of a family of linear subspaces with applications. Beitr\u00e4ge zur Algebra und Geometrie\/Contributions to Algebra and Geometry 60 3 (2019) 471\u2013485.","DOI":"10.1007\/s13366-018-00432-9"},{"key":"e_1_3_2_1_38_1","unstructured":"Ravi Vakil. 2013. Foundations of algebraic geometry."},{"key":"e_1_3_2_1_39_1","first-page":"90","article-title":"List decoding","volume":"48","author":"Wozencraft John M","year":"1958","unstructured":"John M Wozencraft. 1958. List decoding. Quarterly Progress Report, 48 (1958), 90\u201395.","journal-title":"Quarterly Progress Report"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2932663"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vancouver BC Canada","acronym":"STOC '24"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649651","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:51Z","timestamp":1750291431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":41,"alternative-id":["10.1145\/3618260.3649651","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649651","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}