{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T16:10:49Z","timestamp":1784823049257,"version":"3.55.0"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Characteristic Innovation Project of Guangdong Provincial Department of Education","award":["2017KTSCX173"],"award-info":[{"award-number":["2017KTSCX173"]}]},{"DOI":"10.13039\/501100006410","name":"Huizhou University","doi-asserted-by":"publisher","award":["2016JB005"],"award-info":[{"award-number":["2016JB005"]}],"id":[{"id":"10.13039\/501100006410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1109\/tit.2019.2942304","type":"journal-article","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T20:12:36Z","timestamp":1568923956000},"page":"233-239","source":"Crossref","is-referenced-by-count":13,"title":["New Optimal Cyclic Locally Recoverable Codes of Length $n=2(q+1)$"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4823-8539","authenticated-orcid":false,"given":"Jianfa","family":"Qian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lina","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2605119"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282658"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2016.079496"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133123"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2797988"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2776141"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2882849"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2884930"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref29","article-title":"On optimal locally repairable codes with super-linear length","author":"cai","year":"2018","journal-title":"arXiv 1812 11942"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2017.08.013"},{"key":"ref7","article-title":"Construction of optimal locally repairable codes via automorphism groups of rational function fields","author":"jin","year":"2017","journal-title":"arXiv 1710 09638"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref20","article-title":"Optimal cyclic \n$(r, \\delta)$\n locally repairable codes with unbounded length","author":"fang","year":"2018","journal-title":"arXiv 1805 12345"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2512864"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90887-X"},{"key":"ref25","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8939138\/08844798.pdf?arnumber=8844798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:20:08Z","timestamp":1651080008000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8844798\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":29,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2942304","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}