{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:00Z","timestamp":1773377640334,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518040","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"3379-3384","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Bound for Optimal Locally Repairable Codes"],"prefix":"10.1109","author":[{"given":"Han","family":"Cai","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev,School of Electrical and Computer Engineering,Beer Sheva,Israel,8410501"}]},{"given":"Cuiling","family":"Fan","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University,School of Mathematics,Chengdu,China,610031"}]},{"given":"Ying","family":"Miao","sequence":"additional","affiliation":[{"name":"University of Tsukuba,Faculty of Engineering, Information and Systems,Tsukuba,Japan,305-8573"}]},{"given":"Moshe","family":"Schwartz","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev,School of Electrical and Computer Engineering,Beer Sheva,Israel,8410501"}]},{"given":"Xiaohu","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Southwest Jiaotong University,Chengdu,China,610031"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541377"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3021707"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946637"},{"key":"ref13","article-title":"Optimal lrc codes for all lenghts n?= q","author":"kolosov","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref14","volume":"16","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2934124"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472515"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3037268"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977647"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598149"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036279"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2512864"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.131210"},{"key":"ref2","article-title":"Optimal locally repairable codes: An improved bound and constructions","author":"cai","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518663"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518040.pdf?arnumber=9518040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:43Z","timestamp":1773347683000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518040\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518040","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}