{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T17:35:09Z","timestamp":1789752909941,"version":"4.0.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["ECR\/2016\/000954"],"award-info":[{"award-number":["ECR\/2016\/000954"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2017\/000806"],"award-info":[{"award-number":["MTR\/2017\/000806"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1109\/tit.2022.3212076","type":"journal-article","created":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T19:37:09Z","timestamp":1664998629000},"page":"842-859","source":"Crossref","is-referenced-by-count":4,"title":["Maximally Recoverable Codes With Hierarchical Locality: Constructions and Field-Size Bounds"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3276-0453","authenticated-orcid":false,"given":"D.","family":"Shivakrishna","sequence":"first","affiliation":[{"name":"Signal Processing and Communications Research Centre, International Institute of Information Technology, Hyderabad, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aaditya M.","family":"Nair","sequence":"additional","affiliation":[{"name":"Meta, London, U.K"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2874-8910","authenticated-orcid":false,"given":"V.","family":"Lalitha","sequence":"additional","affiliation":[{"name":"Signal Processing and Communications Research Centre, International Institute of Information Technology, Hyderabad, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2019.8732208"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517844"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref6","first-page":"15","article-title":"Erasure coding in windows azure storage","volume-title":"Proc. USENIX Annu. Tech. Conf. (USENIX ATC)","author":"Huang"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518663"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990981"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120016"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282781"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2627569"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2988459"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3176807"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.136"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174400"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447093"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2921540"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977636"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2980837"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2919830"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849656"},{"issue":"1","key":"ref31","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problems Inf. Transmiss."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2911595"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10024105\/09911765.pdf?arnumber=9911765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T22:13:11Z","timestamp":1705961591000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9911765\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":34,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3212076","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]}}}