{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:11Z","timestamp":1772283491491,"version":"3.50.1"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Center for Memory and Recording Research (CMRR) at UCSD"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1405119"],"award-info":[{"award-number":["CCF-1405119"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1619053"],"award-info":[{"award-number":["CCF-1619053"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2015816"],"award-info":[{"award-number":["2015816"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1624\/14"],"award-info":[{"award-number":["1624\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NISE Program at SSC Pacific"},{"name":"CMRR at UCSD"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/tit.2018.2890201","type":"journal-article","created":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T20:00:05Z","timestamp":1546027205000},"page":"3692-3701","source":"Crossref","is-referenced-by-count":39,"title":["Constructions of Partial MDS Codes Over Small Fields"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9197-3371","authenticated-orcid":false,"given":"Ryan","family":"Gabrys","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9851-5234","authenticated-orcid":false,"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5711-9411","authenticated-orcid":false,"given":"Mario","family":"Blaum","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5850-0874","authenticated-orcid":false,"given":"Paul H.","family":"Siegel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.476238"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2627569"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006478"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053771"},{"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","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8718425\/8594599-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8718425\/08594599.pdf?arnumber=8594599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:49:02Z","timestamp":1657745342000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8594599\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":12,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2890201","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6]]}}}