{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:28Z","timestamp":1773377668199,"version":"3.50.1"},"reference-count":15,"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.8849762","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2828-2832","source":"Crossref","is-referenced-by-count":3,"title":["Classification of Optimal Ternary (r, \u03b4)-Locally Repairable Codes Attaining the Singleton-like Bound"],"prefix":"10.1109","author":[{"given":"Jie","family":"Hao","sequence":"first","affiliation":[{"name":"Information Security Center, Beijing University of Posts and Telecommunications, Beijing, China"}]},{"given":"Kenneth W.","family":"Shum","sequence":"additional","affiliation":[{"name":"School of Science and Engineering, The Chinese University of Hong Kong (Shenzhen), Shenzhen, China"}]},{"given":"Shu-Tao","family":"Xia","sequence":"additional","affiliation":[{"name":"Graduate School at Shenzhen, Tsinghua University, Shenzhen, China"}]},{"given":"Yi-Xian","family":"Yang","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\/TIT.2017.2761120"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref12","first-page":"1","article-title":"On the linear codes with (r, ?)-locality for distributed storage","author":"hao","year":"2017","journal-title":"IEEE Int Conf on Commun"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008247720662"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437466"},{"key":"ref15","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282658"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006512"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541337"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2512864"}],"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\/08849762.pdf?arnumber=8849762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:48Z","timestamp":1773347688000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849762\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849762","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}