{"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":1775492129361,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437821","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1191-1195","source":"Crossref","is-referenced-by-count":3,"title":["On Optimal Pseudo-cyclic ($r, \\delta$) Locally Repairable Codes"],"prefix":"10.1109","author":[{"given":"Bin","family":"Chen","sequence":"first","affiliation":[{"name":"Tsinghua University, Graduate School at Shenzhen, Shenzhen, China"}]},{"given":"Shu-Tao","family":"Xia","sequence":"additional","affiliation":[{"name":"Tsinghua University, Graduate School at Shenzhen, Shenzhen, China"}]},{"given":"Jie","family":"Hao","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telcommunications, Information Security Center, Beijing, China"}]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[{"name":"Nankai University, Chern Institute of Mathematics and LPMC, Tianjin, China"}]}],"member":"263","reference":[{"key":"ref10","first-page":"284","article-title":"Cyclic (q + 1, k) codes of odd order q are not optimal","volume":"30","author":"georgiades","year":"1982","journal-title":"Proc Atti Sem Mat Fis Univ Monda"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(92)90104-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056909"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.53751"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(92)90104-3"},{"key":"ref15","author":"macwilliams","year":"1981","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref16","author":"li","year":"0","journal-title":"Optimal locally repairable codes via elliptic curves"},{"key":"ref17","author":"jin","year":"0","journal-title":"Construction of optimal locally repairable codes via automorphism groups of rational function fields"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282658"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133128"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133123"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055222"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO, USA","start":{"date-parts":[[2018,6,17]]},"end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437821.pdf?arnumber=8437821","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:17Z","timestamp":1754502977000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437821\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437821","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}