{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T16:15:29Z","timestamp":1775492129745,"version":"3.50.1"},"reference-count":25,"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"}],"funder":[{"DOI":"10.13039\/100006190","name":"Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006190","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834361","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"3126-3131","source":"Crossref","is-referenced-by-count":2,"title":["Optimal and Almost Optimal Cyclic (r,\u03b4)-LRCs With Large Code Lengths"],"prefix":"10.1109","author":[{"given":"Jing","family":"Qiu","sequence":"first","affiliation":[{"name":"Nankai University,Chern Institute of Mathematics and LPMC,Tianjin,China,300071"}]},{"given":"Weijun","family":"Fang","sequence":"additional","affiliation":[{"name":"Shandong University,School of Cyber Science and Technology,Qingdao,China,266237"}]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[{"name":"Nankai University,Chern Institute of Mathematics and LPMC,Tianjin,China,300071"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977647"},{"key":"ref11","first-page":"9-8:198:13","article-title":"Construction of optimal locally recoverable codes and connection with hypergraph","author":"xing","year":"2019","journal-title":"Proceedings of the 20th International Colloquium on Automata Languages and Programming"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3103330"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282658"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2016.079496"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2916085"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101650"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946637"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849478"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2901492"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036279"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2884930"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3043759"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2776141"},{"key":"ref24","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517911"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"}],"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\/09834361.pdf?arnumber=9834361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:45Z","timestamp":1773347745000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834361\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834361","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}