{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T05:22:42Z","timestamp":1774070562406,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"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.3649637","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"728-739","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Generalized GM-MDS: Polynomial Codes Are Higher Order MDS"],"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, United States"}],"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. 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_2_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_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206952"},{"key":"e_1_3_2_1_4_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 preprint arXiv:2310.12898.","DOI":"10.1145\/3618260.3649651"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3187366"},{"key":"e_1_3_2_1_6_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_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620554"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875141"},{"key":"e_1_3_2_1_9_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."},{"key":"e_1_3_2_1_10_1","volume-title":"Rank codes","author":"Gabidulin Ernst M","unstructured":"Ernst M Gabidulin. 2021. Rank codes. TUM. University Press."},{"key":"e_1_3_2_1_11_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_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.136"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2897767"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Zeyu Guo and Zihan Zhang. 2023. Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets. arXiv preprint arXiv:2304.01403.","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874913"},{"key":"e_1_3_2_1_16_1","volume-title":"d.]. Notes on Coding Theory (Chapter 5\u2014Generalized Reed-Solomon Codes). Department of Mathematics","author":"Hall JI","unstructured":"JI Hall. [n. d.]. Notes on Coding Theory (Chapter 5\u2014Generalized Reed-Solomon Codes). Department of Mathematics, Michigan State University available online at http:\/\/users. math. msu. edu\/users\/jhall\/classes\/codenotes\/coding-notes. html (Jan. 7, 2015 revision)."},{"key":"e_1_3_2_1_17_1","volume-title":"Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix. In 2023 IEEE Information Theory Workshop (ITW). 7\u201312","author":"Liu Hedongliang","year":"2023","unstructured":"Hedongliang Liu, Hengjia Wei, Antonia Wachter-Zeh, and Moshe Schwartz. 2023. Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix. In 2023 IEEE Information Theory Workshop (ITW). 7\u201312."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323345"},{"key":"e_1_3_2_1_19_1","volume-title":"The theory of error correcting codes. 16","author":"MacWilliams Florence Jessie","unstructured":"Florence Jessie MacWilliams and Neil James Alexander Sloane. 1977. The theory of error correcting codes. 16, Elsevier."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3194521"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384295"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"e_1_3_2_1_24_1","volume-title":"Warm BLOB Storage System. In 11th USENIX Symposium on Operating Systems Design and Implementation, OSDI \u201914","author":"Subramanian Muralidhar","year":"2014","unstructured":"Muralidhar Subramanian, Wyatt Lloyd, Sabyasachi Roy, Cory Hill, Ernest Lin, Weiwen Liu, Satadru Pan, Shiva Shankar, Sivakumar Viswanathan, Linpeng Tang, and Sanjeev Kumar. 2014. f4: Facebook\u2019s Warm BLOB Storage System. In 11th USENIX Symposium on Operating Systems Design and Implementation, OSDI \u201914, Broomfield, CO, USA, October 6-8, 2014, Jason Flinn and Hank Levy (Eds.). USENIX Association, 383\u2013398. https:\/\/www.usenix.org\/conference\/osdi14\/technical-sessions\/presentation\/muralidhar"},{"key":"e_1_3_2_1_25_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_26_1","unstructured":"Ravi Vakil. 2013. Foundations of algebraic geometry."},{"key":"e_1_3_2_1_27_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_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570836"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2932663"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955106"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"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.3649637","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:47Z","timestamp":1750178207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":30,"alternative-id":["10.1145\/3618260.3649637","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649637","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"}}]}}