{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:32:19Z","timestamp":1761060739946,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613345","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T00:39:34Z","timestamp":1547771974000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Cyclic (r, \u1e9f) Locally Repairable Codes with Unbounded Length"],"prefix":"10.1109","author":[{"given":"Weijun","family":"Fang","sequence":"first","affiliation":[]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282658"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"article-title":"Optimal LRC codes for all lengths n ? q","year":"0","author":"kolosov","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011283523000"},{"key":"ref16","first-page":"130133","article-title":"Cyclic and pseudo-cyclic MDS codes of length q+1","volume":"59","author":"dahl","year":"1992","journal-title":"Journal of Combinatorial Theory"},{"journal-title":"How long can optimal locally repairable codes be?","year":"0","author":"guruswami","key":"ref17"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"article-title":"Optimal locally repairable codes of distance 3 and 4 via cyclic codes","year":"0","author":"luo","key":"ref3"},{"article-title":"Construction of optimal locally repairable codes via automorphism groups of rational function fields","year":"0","author":"jin","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"article-title":"Optimal locally repairable codes via ellipitic curves","year":"0","author":"li","key":"ref7"},{"key":"ref2","first-page":"2776","author":"prakash","year":"0","journal-title":"Proc Int Symp Inf Theory (ISIT)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"}],"event":{"name":"2018 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2018,11,25]]},"location":"Guangzhou","end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8598908\/8613300\/08613345.pdf?arnumber=8613345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T22:45:20Z","timestamp":1643237120000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613345\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613345","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}