{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:55:59Z","timestamp":1781078159431,"version":"3.54.1"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Microsoft Research Ph. The work of Manik Dhar was supported by NSF","award":["DMS-1953807"],"award-info":[{"award-number":["DMS-1953807"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tit.2024.3449030","type":"journal-article","created":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T17:48:17Z","timestamp":1724435297000},"page":"6950-6960","source":"Crossref","is-referenced-by-count":7,"title":["Improved Field Size Bounds for Higher Order MDS Codes"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4149-7298","authenticated-orcid":false,"given":"Joshua","family":"Brakensiek","sequence":"first","affiliation":[{"name":"Computer Science Department, Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manik","family":"Dhar","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9706-4171","authenticated-orcid":false,"given":"Sivakanth","family":"Gopi","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3187366"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384295"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/20M138795X"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"ref5","first-page":"15","article-title":"Erasure coding in windows Azure storage","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Huang"},{"key":"ref6","first-page":"298","article-title":"Screaming fast Galois field arithmetic using Intel SIMD instructions","volume-title":"Proc. 11th USENIX Conf. File Storage Technologies","author":"Plank"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3194521"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585128"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.136"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2023.105835"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875141"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095170"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323345"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2932663"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-021-01013-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206712"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3405392"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649634"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649651"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s13366-018-00432-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16721-3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/141000671"},{"key":"ref24","volume-title":"OSCAR\u2014Open Source Computer Algebra Research System, Version 1.2.0-DEV","year":"2024"},{"key":"ref25","volume":"32","author":"Decker","year":"2024","journal-title":"The Computer Algebra System OSCAR: Algorithms and Examples"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10682502\/10644007-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10682502\/10644007.pdf?arnumber=10644007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T17:56:09Z","timestamp":1726682169000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10644007\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":25,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3449030","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}