{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:58:58Z","timestamp":1774418338547,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437466","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"1326-1330","source":"Crossref","is-referenced-by-count":13,"title":["On the Maximal Code Length of Optimal Linear Locally Repairable Codes"],"prefix":"10.1109","author":[{"given":"Jie","family":"Hao","sequence":"first","affiliation":[]},{"given":"Kenneth","family":"Shum","sequence":"additional","affiliation":[]},{"given":"Shu-Tao","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Yi-Xian","family":"Yang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00124590"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01222850"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008247720662"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278028"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref3","author":"hao","year":"0","journal-title":"Bounds and constructions of locally repairable codes Parity-check matrix approach"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282658"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472515"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133128"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541337"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"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":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO","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\/08437466.pdf?arnumber=8437466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:09:21Z","timestamp":1598242161000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437466\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437466","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}