{"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":1772283491052,"version":"3.50.1"},"reference-count":39,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/allerton.2018.8635867","type":"proceedings-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T03:04:31Z","timestamp":1551409471000},"page":"792-799","source":"Crossref","is-referenced-by-count":5,"title":["Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes"],"prefix":"10.1109","author":[{"given":"Umberto","family":"Martinez-Penas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.50376"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055435"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846403"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507933"},{"key":"ref30","first-page":"1","article-title":"Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes","author":"martinez-penas","year":"2018"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(88)90063-4"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1109\/ALLERTON.2018.8635644","article-title":"Reliable and secure multishot network coding via linearized Reed-Solomon codes","author":"martinez-penas","year":"2018","journal-title":"in Proc 56th Annual Allerton Conference on Communication Control and Computing (Allerton)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"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":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541336"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541377"},{"key":"ref15","first-page":"2038","article-title":"Locally repairable codes with multiple $(r_{i},\\delta _{i})-$ localities","author":"chen","year":"2017","journal-title":"Proc IEEE Int Symp Info Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2834942"},{"key":"ref17","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inform Transmission"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2018.02.005"},{"key":"ref4","first-page":"15","article-title":"Erasure coding in Windows Azure storage","author":"huang","year":"2012","journal-title":"2012 USENIX Annual Technical Conference Boston MA"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006478"},{"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":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"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":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref22","article-title":"On maximally recoverable local reconstruction codes","volume":"24","author":"gopi","year":"2017","journal-title":"Electronic Colloq on Comp Complexity"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"ref23","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":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2627569"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"}],"event":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2018,10,2]]},"end":{"date-parts":[[2018,10,5]]}},"container-title":["2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8630872\/8635635\/08635867.pdf?arnumber=8635867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T23:06:55Z","timestamp":1598224015000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8635867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/allerton.2018.8635867","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}