{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:55:58Z","timestamp":1781078158681,"version":"3.54.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF-7027-00053B"],"award-info":[{"award-number":["DFF-7027-00053B"]}],"id":[{"id":"10.13039\/100008394","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/tit.2019.2924888","type":"journal-article","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T20:29:52Z","timestamp":1561494592000},"page":"7790-7805","source":"Crossref","is-referenced-by-count":83,"title":["Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2626-8139","authenticated-orcid":false,"given":"Umberto","family":"Martinez-Penas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4274-1785","authenticated-orcid":false,"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846403"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507933"},{"key":"ref33","article-title":"Constructions of maximally recoverable local reconstruction codes via function fields","author":"guruswami","year":"2018","journal-title":"arXiv 1808 04539"},{"key":"ref32","article-title":"Random construction of partial MDS codes","author":"neri","year":"2018","journal-title":"arXiv 1801 05848"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2627569"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2019.8732208"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2018.02.005"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"ref27","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":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2834942"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref21","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"ref26","first-page":"1","article-title":"On maximally recoverable local reconstruction codes","volume":"24","author":"gopi","year":"2017","journal-title":"Electron Colloq Comput Complex"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63931-4_4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541336"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541377"},{"key":"ref19","first-page":"2038","article-title":"Locally repairable codes with multiple \n$(r_{i},\\delta_{i})$\n-localities","author":"chen","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref4","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557599"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/18.50376"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262863"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(88)90063-4"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055435"},{"key":"ref47","article-title":"Extended integrated interleaved codes over any field with applications to locally recoverable codes","author":"blaum","year":"2018","journal-title":"arXiv 1805 10268"},{"key":"ref42","article-title":"Reliable and secure multishot network coding using linearized Reed–Solomon codes","author":"mart\u00ednez-pe\u00f1as","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref44","first-page":"193","article-title":"A general theory of Vandermonde matrices","volume":"4","author":"lam","year":"1986","journal-title":"Expositiones Mathematicae"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8907537\/08745538.pdf?arnumber=8745538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:41:28Z","timestamp":1657744888000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8745538\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":49,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2924888","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]}}}