{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:54Z","timestamp":1773378174933,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834863","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1181-1186","source":"Crossref","is-referenced-by-count":2,"title":["Some Results on Maximally Recoverable Codes with Locality and Hierarchical Locality"],"prefix":"10.1109","author":[{"given":"D.","family":"Shivakrishna","sequence":"first","affiliation":[{"name":"International Institute of Information Technology Hyderabad,SPCRC"}]},{"given":"V.","family":"Lalitha","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology Hyderabad,SPCRC"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120016"},{"key":"ref11","article-title":"Improved maximally recoverable LRCs using skew polynomials","author":"gopi","year":"2020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517844"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2019.8732208"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2873128"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2018.02.005"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1007\/s10623-019-00705-x","article-title":"Random construction of partial MDS codes","volume":"88","author":"neri","year":"2019","journal-title":"Designs Codes and Cryptography"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834863"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2627569"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2988459"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955106"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834863.pdf?arnumber=9834863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:38Z","timestamp":1773347798000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834863\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834863","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}