{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:54:30Z","timestamp":1767912870989,"version":"3.49.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"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":[[2022,8,11]]},"DOI":"10.1109\/iccc55456.2022.9880643","type":"proceedings-article","created":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T19:16:23Z","timestamp":1663874183000},"page":"365-370","source":"Crossref","is-referenced-by-count":4,"title":["Some Results on the Improved Bound and Construction of Optimal $(r,\\ \\delta)$ LRCs"],"prefix":"10.1109","author":[{"given":"Bin","family":"Chen","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology,Shenzhen,China,518055"}]},{"given":"Weijun","family":"Fang","sequence":"additional","affiliation":[{"name":"Shandong University,School of Cyber Science and Technology,Qingdao,Shandong,P.R. China,266237"}]},{"given":"Yueqi","family":"Chen","sequence":"additional","affiliation":[{"name":"Tsinghua University,Tsinghua Shenzhen International Graduate School,Shenzhen,China,518055"}]},{"given":"Shu-Tao","family":"Xia","sequence":"additional","affiliation":[{"name":"Tsinghua University,Tsinghua Shenzhen International Graduate School,Shenzhen,China,518055"}]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[{"name":"Nankai University,Chern Institute of Mathematics and LPMC,Tianjin,China,300071"}]},{"given":"Xiangyu","family":"Chen","sequence":"additional","affiliation":[{"name":"6HUAWEI Technologies Co., Ltd.,Shenzhen,P.R. China,518055"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2916085"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2901492"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref13","article-title":"Construction of optimal locally recoverable codes and connection with hypergraph","author":"xing","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036279"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.024"},{"key":"ref4","article-title":"Xoring elephants: Novel erasure codes for big data","volume":"6","author":"asteris","year":"2013","journal-title":"Proceedings of the VLDB Endowment"},{"key":"ref27","volume":"16","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref3","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"0","journal-title":"2012 USENIX Annual Technical Conference ( USENIX ATC 12)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0156-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977647"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977636"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3037268"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101650"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3103330"},{"key":"ref26","article-title":"Optimal quaternary (r,? )-locally repairable codes achieving the singleton-type bound","author":"shum","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3021707"}],"event":{"name":"2022 IEEE\/CIC International Conference on Communications in China (ICCC)","location":"Sanshui, Foshan, China","start":{"date-parts":[[2022,8,11]]},"end":{"date-parts":[[2022,8,13]]}},"container-title":["2022 IEEE\/CIC International Conference on Communications in China (ICCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9880588\/9880614\/09880643.pdf?arnumber=9880643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T16:50:48Z","timestamp":1665766248000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9880643\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,11]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/iccc55456.2022.9880643","relation":{},"subject":[],"published":{"date-parts":[[2022,8,11]]}}}