{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:10:02Z","timestamp":1784301002943,"version":"3.55.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801392"],"award-info":[{"award-number":["11801392"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20180833"],"award-info":[{"award-number":["BK20180833"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971325"],"award-info":[{"award-number":["11971325"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2020YFA0712100"],"award-info":[{"award-number":["2020YFA0712100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFA0704703"],"award-info":[{"award-number":["2018YFA0704703"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Scholars Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/tit.2021.3103330","type":"journal-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T20:45:34Z","timestamp":1628541934000},"page":"6491-6506","source":"Crossref","is-referenced-by-count":27,"title":["New Constructions of Optimal Locally Repairable Codes With Super-Linear Length"],"prefix":"10.1109","volume":"67","author":[{"given":"Xiangliang","family":"Kong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6364-8275","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1535-0754","authenticated-orcid":false,"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518663"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977636"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2998587"},{"key":"ref35","first-page":"98:1","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":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3037268"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2020.10.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990981"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3021707"},{"key":"ref17","first-page":"2","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Conf Annu Tech Conf (USENIX ATC)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2901492"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946637"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/19M1248108"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2919830"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9482-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876421"},{"key":"ref5","first-page":"53","article-title":"Some extremal problems on r-graphs","author":"brown","year":"1973","journal-title":"Proc 3rd Ann Arbor Conf New Directions Theory Graphs"},{"key":"ref8","first-page":"1","article-title":"Optimal locally repairable codes: An improved bound and constructions","volume":"abs 2011 4966","author":"cai","year":"2020","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2869800"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977647"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0035-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2980837"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2560013"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9539105\/09509014.pdf?arnumber=9509014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:31Z","timestamp":1652194471000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9509014\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":37,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3103330","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}