{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:04:21Z","timestamp":1730279061128,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613444","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":0,"title":["On Optimal (r, \u03b4)-LRCs with Length n | (q+1)"],"prefix":"10.1109","author":[{"given":"Weijun","family":"Fang","sequence":"first","affiliation":[]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Shu-Tao","family":"Xia","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/JSAC.2014.140521"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ITW.2015.7133128"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIT.2014.2325570"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2010.2054295"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ISIT.2013.6620540"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"4637","DOI":"10.1109\/TIT.2014.2329872","article-title":"Codes with local regeneration and erasure correction","volume":"60","author":"prakash","year":"2014","journal-title":"IEEE Trans Inf Theory"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref17","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"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/18.53751"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/ISIT.2013.6620541"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TIT.2017.2700859"},{"key":"ref6","first-page":"1191","article-title":"On optimal pseudo-cyclic (r, ?) locally repairable codes","author":"chen","year":"2018","journal-title":"Proc Int Symp Inf Theory"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TIT.2017.2761120"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/ISIT.2015.7282658"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TIT.2014.2321280"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/ISIT.2012.6284028"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TIT.2012.2208937"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1023\/A:1011283523000"}],"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\/08613444.pdf?arnumber=8613444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T23:47:09Z","timestamp":1643240829000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613444\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613444","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}