{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:11:03Z","timestamp":1784301063637,"version":"3.55.0"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"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"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1109\/lcomm.2020.2998587","type":"journal-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T21:49:06Z","timestamp":1590788946000},"page":"1852-1856","source":"Crossref","is-referenced-by-count":12,"title":["A New Construction of Optimal (<i>r<\/i>, \u03b4) Locally Recoverable Codes"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7087-8316","authenticated-orcid":false,"given":"Guanghui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Optimal LRC codes with $n\\sim q^{2}$\n, unbounded localities and unbounded minimum distances","author":"chen","year":"2019","journal-title":"arXiv 1910 07267"},{"key":"ref11","article-title":"Optimal cyclic $(r, \\delta)$\n locally repairable codes with unbounded length","author":"fang","year":"2018","journal-title":"arXiv 1805 12345"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2884930"},{"key":"ref13","article-title":"Dynamic role binding in blockchain-based collaborative business processes","author":"l\u00f3pez-pintado","year":"2018","journal-title":"arXiv 1812 02909"},{"key":"ref14","article-title":"Bayes-optimal methods for finding the source of a cascade","author":"sridhar","year":"2020","journal-title":"arXiv 2001 11942"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2901492"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946637"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2323309"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-019-2649-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2916085"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2700862"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2957942"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref2","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2020.2977636","article-title":"Constructions of optimal codes with hierarchical locality","author":"zhang","year":"2020","journal-title":"IEEE Trans Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref21","first-page":"98","article-title":"Construction of optimal locally recoverable codes and connection with Hypergraph","volume":"132","author":"xing","year":"2019","journal-title":"Proc 46th Int Colloq Automata Lang Program (ICALP)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2919830"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9444-4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24298-9_4"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/9190044\/09103542.pdf?arnumber=9103542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:48:13Z","timestamp":1651074493000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9103542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":29,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2020.2998587","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"value":"1089-7798","type":"print"},{"value":"1558-2558","type":"electronic"},{"value":"2373-7891","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]}}}