{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:50:51Z","timestamp":1773377451794,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849478","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2823-2827","source":"Crossref","is-referenced-by-count":7,"title":["Improved bounds and Optimal Constructions of Locally Repairable Codes with distance 5 and 6"],"prefix":"10.1109","author":[{"given":"Bin","family":"Chen","sequence":"first","affiliation":[{"name":"Graduate School at Shenzhen, Tsinghua University, Shenzhen, China"}]},{"given":"Shu-Tao","family":"Xia","sequence":"additional","affiliation":[{"name":"Graduate School at Shenzhen, Tsinghua University, Shenzhen, China"}]},{"given":"Jie","family":"Hao","sequence":"additional","affiliation":[{"name":"Information Security Center, Beijing University of Posts and Telecommunications, Beijing, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541337"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref12","article-title":"Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes","author":"jin","year":"2018","journal-title":"CoRR"},{"key":"ref13","article-title":"Construction of optimal locally recoverable codes and connection with hypergraph","author":"xing","year":"2018","journal-title":"CoRR"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006512"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006886"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0156-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref4","article-title":"Bounds and constructions of locally repairable codes: parity-check matrix approach","author":"hao","year":"0","journal-title":"CoRR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437466"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref1","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849478.pdf?arnumber=8849478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:45Z","timestamp":1773347625000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849478\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849478","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}