{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T06:05:40Z","timestamp":1779516340314,"version":"3.53.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Grant","award":["DMS-2503280"],"award-info":[{"award-number":["DMS-2503280"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1109\/tit.2026.3685533","type":"journal-article","created":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T20:03:38Z","timestamp":1776715418000},"page":"3820-3829","source":"Crossref","is-referenced-by-count":0,"title":["Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4149-7298","authenticated-orcid":false,"given":"Joshua","family":"Brakensiek","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5570-7116","authenticated-orcid":false,"given":"Manik","family":"Dhar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA, 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.1137\/1.9781611974782.136"},{"key":"ref2","first-page":"383","article-title":"F4: Facebook\u2019s warm BLOB storage system","volume-title":"Proc. 11th USENIX Symp. Operating Syst. Design Implement.","author":"Muralidhar"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref5","first-page":"15","article-title":"Erasure coding in windows Azure storage","volume-title":"Proc. USENIX Annu. Tech. Conf. (USENIX ATC)","author":"Huang"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990981"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120016"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3176807"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206554"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2026.3694571"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2018.8599965"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-021-01013-1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3187366"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3194521"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518208"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206712"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/23m1598064"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3623524"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649634"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3405392"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3577506"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.19086\/aic.2025.8"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3449030"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-026-00208-z"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/6512"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/18M1205856"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103564"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-71522-9_387"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"ref37","first-page":"147","article-title":"Codes correcteurs d\u2019erreurs","volume":"2","author":"Hocquenghem","year":"1959","journal-title":"Chiffres"},{"key":"ref38","volume-title":"Essential Coding Theory","author":"Guruswami","year":"2023"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.32.12.331"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.4153\/cjm-1953-027-0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-011-0061-1"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00059"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06924-6"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2017.185.1.8"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2017.185.1.7"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/11534061\/11488385-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11534061\/11488385.pdf?arnumber=11488385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T05:21:57Z","timestamp":1779513717000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11488385\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":45,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3685533","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]}}}