{"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":1774070562432,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206952","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1243-1248","source":"Crossref","is-referenced-by-count":9,"title":["Improved Field Size Bounds for Higher Order MDS Codes"],"prefix":"10.1109","author":[{"given":"Joshua","family":"Brakensiek","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Manik","family":"Dhar","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Sivakanth","family":"Gopi","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2932663"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00027"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s13366-018-00432-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-021-01013-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095170"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875141"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384295"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3187366"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/141000671"},{"key":"ref16","author":"cox","year":"2013","journal-title":"Ideals Varieties and Algorithms An Introduction to Computational Algebraic Geometry and Commutative Algebra"},{"key":"ref19","author":"decker","year":"2024","journal-title":"The OSCAR book"},{"key":"ref18","article-title":"Oscar – open source computer algebra research system, version 0.11.3-dev","year":"2022","journal-title":"OscaR Team"},{"key":"ref8","first-page":"2092","article-title":"Maximally recoverable codes for grid-like topologies","author":"gopalan","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref7","article-title":"Generic reed-solomon codes achieve list-decoding capacity","author":"brakensiek","year":"2022","journal-title":"ArXiv"},{"key":"ref9","article-title":"Singleton-type bounds for list-decoding and list-recovery, and related results","author":"goldberg","year":"2021"},{"key":"ref4","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"2012 USENIX Annual Technical Conference (USENIX ATC 12)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3194521"},{"key":"ref5","article-title":"Screaming fast galois field arithmetic using intel simd instructions","author":"plank","year":"2013","journal-title":"USENIX Conference on File and Storage Technologies"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206952.pdf?arnumber=10206952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:35Z","timestamp":1773347195000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206952\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206952","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}