{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T16:03:18Z","timestamp":1770825798015,"version":"3.50.1"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Science and Technology Development Program of Henan Province in 2019","award":["192102310444"],"award-info":[{"award-number":["192102310444"]}]},{"DOI":"10.13039\/501100009101","name":"Key Research Project of Higher Education of the Education Department of Henan Province in 2019","doi-asserted-by":"publisher","award":["19A120010"],"award-info":[{"award-number":["19A120010"]}],"id":[{"id":"10.13039\/501100009101","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["11871025"],"award-info":[{"award-number":["11871025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1109\/tit.2020.2977636","type":"journal-article","created":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T21:06:12Z","timestamp":1583183172000},"page":"7333-7340","source":"Crossref","is-referenced-by-count":22,"title":["Constructions of Optimal Codes With Hierarchical Locality"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7087-8316","authenticated-orcid":false,"given":"Guanghui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3503-8220","authenticated-orcid":false,"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2901492"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946637"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2019.8732208"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2884930"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2748955"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2957942"},{"key":"ref6","article-title":"Optimal cyclic (?, ?) locally repairable codes with unbounded length","author":"fang","year":"2018","journal-title":"arXiv 1805 12345"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref7","article-title":"Maximally recoverable LRCs: A field size lower bound and constructions for few heavy parities","author":"gopi","year":"2017","journal-title":"arXiv 1710 10322"},{"key":"ref2","first-page":"5253","article-title":"Constructions of optimal (?, ?) locally recoverable codes via constacyclic codes","volume":"2020","author":"liu","year":"2020","journal-title":"Des Codes Cryptogr"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2919830"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9266290\/09020115.pdf?arnumber=9020115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:22:44Z","timestamp":1651080164000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9020115\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":20,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2977636","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}