{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:53:10Z","timestamp":1776955990456,"version":"3.51.4"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Project","award":["2021YFE0109900"],"award-info":[{"award-number":["2021YFE0109900"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12031011"],"award-info":[{"award-number":["12031011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101403"],"award-info":[{"award-number":["12101403"]}],"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":[[2022,7]]},"DOI":"10.1109\/tit.2022.3157612","type":"journal-article","created":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T21:53:53Z","timestamp":1646776433000},"page":"4320-4328","source":"Crossref","is-referenced-by-count":18,"title":["Construction of Optimal (<i>r<\/i>, \u03b4)-Locally Recoverable Codes and Connection With Graph Theory"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1257-1033","authenticated-orcid":false,"given":"Chaoping","family":"Xing","sequence":"first","affiliation":[{"name":"School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3730-8397","authenticated-orcid":false,"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63931-4_4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2700859"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00222-010-0247-x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570829"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977647"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2916085"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036279"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174347"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101650"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.01.016"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref15","first-page":"1","article-title":"How long can optimal locally repairable codes be?","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM","author":"Guruswami","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3021707"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2002.2123"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref19","first-page":"15","article-title":"Erasure coding in windows azure storage","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Huang"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2901492"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946637"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3103330"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2884930"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518663"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1201\/9781420074000-11"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24298-9_4"},{"key":"ref35","first-page":"1","article-title":"Construction of optimal locally recoverable codes and connection with hypergraph","volume-title":"Proc. 46th Int. Colloq. Automata, Lang., Program. (ICALP)","volume":"132","author":"Xing"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9798707\/09729861.pdf?arnumber=9729861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:09:15Z","timestamp":1705532955000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9729861\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":35,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3157612","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}