{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:37:43Z","timestamp":1757313463033,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Major Program of Guangdong Basic and Applied Research","award":["2019B030302008"],"award-info":[{"award-number":["2019B030302008"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["62032009"],"award-info":[{"award-number":["62032009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61825203","U1736203"],"award-info":[{"award-number":["61825203","U1736203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61877029"],"award-info":[{"award-number":["61877029"]}],"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":[[2021,5]]},"DOI":"10.1109\/tit.2021.3052749","type":"journal-article","created":{"date-parts":[[2021,1,22]],"date-time":"2021-01-22T23:21:03Z","timestamp":1611357663000},"page":"2786-2792","source":"Crossref","is-referenced-by-count":11,"title":["Long Optimal and Small-Defect LRC Codes With Unbounded Minimum Distances"],"prefix":"10.1109","volume":"67","author":[{"given":"Hao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiqi","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/ITW.2015.7133123"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1109\/TIT.2017.2661313"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref32","first-page":"1819","article-title":"Optimal locally repairable codes via rank-distance codes","author":"silberstein","year":"2013","journal-title":"Proc ISIT"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/LCOMM.2014.2332491"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref37","first-page":"1","article-title":"Construction of optimal locally recoverable codes and connection with hypergraph","author":"xing","year":"2019","journal-title":"Proc ICALP"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/ITW.2014.6970906"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/TIT.2016.2518663"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1504\/IJICOT.2016.079496"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1007\/BF01222850"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/S0012-365X(99)00168-5"},{"key":"ref12","first-page":"6","author":"dodunekov","year":"2008","journal-title":"Applications of near MDS codes in cryptography"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1023\/A:1008247720662"},{"key":"ref14","first-page":"1","article-title":"Optimal cyclic (?, ?) locally reparable codes, with unbounded length","volume":"2018","author":"fang","year":"2018","journal-title":"ITW"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1090\/S0025-5718-99-01143-6"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TIT.2012.2208937"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/ISIT.2014.6874918"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TIT.2008.928297"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/TIT.2019.2891765"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/TIT.2019.2939464"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/ALLERTON.2018.8636018"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TIT.2020.2970419"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/978-3-319-63931-4_4"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TIT.2015.2477406"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TIT.2014.2325570"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/BF00124590"},{"key":"ref8","article-title":"Long optimal or small-defect LRC codes with unbounded minimum distances","author":"chen","year":"2019","journal-title":"arXiv 1910 07267"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TIT.2017.2761120"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TIT.2017.2700859"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/18.567708"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.4171\/JEMS\/316"},{"key":"ref20","article-title":"Cyclic codes with locality and availability","author":"holzbaur","year":"2018","journal-title":"arXiv 1812 06897"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/TIT.2019.2901492"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TIT.2016.2605119"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TIT.2019.2923609"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TIT.2018.2844216"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/TIT.2018.2854717"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TIT.2017.2713245"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9409872\/09333598.pdf?arnumber=9333598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:14Z","timestamp":1652194454000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9333598\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":39,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3052749","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}