{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:39:46Z","timestamp":1773376786513,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619149","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"1450-1455","source":"Crossref","is-referenced-by-count":0,"title":["Secure Storage Using Maximally Recoverable Locally Repairable Codes"],"prefix":"10.1109","author":[{"given":"Tim","family":"Janz","sequence":"first","affiliation":[{"name":"Institute of Telecommunications, University of Stuttgart,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hedongliang","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute of Communications Engineering, Technical University of Munich,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rawad","family":"Bitar","sequence":"additional","affiliation":[{"name":"Institute of Communications Engineering, Technical University of Munich,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[{"name":"University of Toronto,Edward S. Rogers Sr. Department of Electrical & Computer Engineering,Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990981"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2988459"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3176807"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2627569"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-019-00705-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/20M1356658"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2605118"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10161635"},{"issue":"2","key":"ref20","first-page":"308","article-title":"Vandermonde and wronskian matrices over division rings","volume-title":"Journal of Algebra","volume":"119","author":"Lam","year":"1988"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref22","first-page":"1","article-title":"Theory of codes with maximum rank distance (translation)","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2015.7255141"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2018.02.005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1561\/0100000120"},{"key":"ref26","author":"Janz","year":"2024","journal-title":"Secure storage using maximally recoverable locally repairable codes"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133754"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3145824"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/nla.450"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619149.pdf?arnumber=10619149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:20Z","timestamp":1773347300000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619149\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619149","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}