{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T13:52:35Z","timestamp":1776952355963,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T00:00:00Z","timestamp":1579046400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T00:00:00Z","timestamp":1579046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s11432-019-2649-5","type":"journal-article","created":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T12:02:45Z","timestamp":1579521765000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Locally repairable codes from combinatorial designs"],"prefix":"10.1007","volume":"63","author":[{"given":"Yu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibin","family":"Kan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"2649_CR1","doi-asserted-by":"publisher","first-page":"100301","DOI":"10.1007\/s11432-018-9482-6","volume":"61","author":"S B Balaji","year":"2018","unstructured":"Balaji S B, Krishnan M N, Vajha M, et al. Erasure coding for distributed storage: an overview. Sci China Inf Sci, 2018, 61: 100301","journal-title":"Sci China Inf Sci"},{"key":"2649_CR2","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"A G Dimakis","year":"2010","unstructured":"Dimakis A G, Godfrey P B, Wu Y, et al. Network coding for distributed storage systems. IEEE Trans Inform Theory, 2010, 56: 4539\u20134551","journal-title":"IEEE Trans Inform Theory"},{"key":"2649_CR3","doi-asserted-by":"publisher","first-page":"062308","DOI":"10.1007\/s11432-014-5274-6","volume":"58","author":"S T Liang","year":"2015","unstructured":"Liang S T, Liang W J, Kan H B. Construction of one special minimum storage regenerating code when \u03b1 = 2. Sci China Inf Sci, 2015, 58: 062308","journal-title":"Sci China Inf Sci"},{"key":"2649_CR4","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"Gopalan P, Huang C, Simitci H, et al. On the locality of codeword symbols. IEEE Trans Inform Theory, 2012, 58: 6925\u20136934","journal-title":"IEEE Trans Inform Theory"},{"key":"2649_CR5","unstructured":"Jin L F, Ma L M, Xing C P. Construction of optimal locally repairable codes via automorphism groups of rational function fields. 2017. ArXiv:1710.09638"},{"key":"2649_CR6","doi-asserted-by":"publisher","first-page":"4658","DOI":"10.1109\/TIT.2019.2901492","volume":"65","author":"L F Jin","year":"2019","unstructured":"Jin L F. Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes. IEEE Trans Inform Theory, 2019, 65: 4658\u20134663","journal-title":"IEEE Trans Inform Theory"},{"key":"2649_CR7","doi-asserted-by":"crossref","unstructured":"Prakash N, Kamath G M, Lalitha V, et al. Optimal linear codes with a local-error-correction property. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Cambridge, 2012. 2776\u20132780","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"2649_CR8","doi-asserted-by":"publisher","first-page":"6979","DOI":"10.1109\/TIT.2014.2351404","volume":"60","author":"A Y Wang","year":"2014","unstructured":"Wang A Y, Zhang Z F. Repair locality with multiple erasure tolerance. IEEE Trans Inform Theory, 2014, 60: 6979\u20136987","journal-title":"IEEE Trans Inform Theory"},{"key":"2649_CR9","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1109\/TIT.2016.2524510","volume":"62","author":"A S Rawat","year":"2016","unstructured":"Rawat A S, Papailiopoulos D S, Dimakis A G, et al. Locality and availability in distributed storage. IEEE Trans Inform Theory, 2016, 62: 4481\u20134493","journal-title":"IEEE Trans Inform Theory"},{"key":"2649_CR10","doi-asserted-by":"crossref","unstructured":"Su Y S. Design of membership matrices for (r, t)-availability in distributed storage. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Barcelona, 2016. 998\u20131002","DOI":"10.1109\/ISIT.2016.7541449"},{"key":"2649_CR11","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1109\/LCOMM.2016.2539160","volume":"20","author":"J Hao","year":"2016","unstructured":"Hao J, Xia S T. Constructions of optimal binary locally repairable codes with multiple repair groups. IEEE Commun Lett, 2016, 20: 1060\u20131063","journal-title":"IEEE Commun Lett"},{"key":"2649_CR12","doi-asserted-by":"crossref","unstructured":"Balaji S B, Kumar P V. Bounds on the rate and minimum distance of codes with availability. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Aachen, 2017. 3155\u20133159","DOI":"10.1109\/ISIT.2017.8007111"},{"key":"2649_CR13","doi-asserted-by":"publisher","first-page":"109304","DOI":"10.1007\/s11432-018-9444-4","volume":"61","author":"Y Zhang","year":"2018","unstructured":"Zhang Y, Kan H B. Locally repairable codes with strict availability from linear functions. Sci China Inf Sci, 2018, 61: 109304","journal-title":"Sci China Inf Sci"},{"key":"2649_CR14","doi-asserted-by":"crossref","unstructured":"Balaji S B, Prasanth K P, Kumar P V. Binary codes with locality for multiple erasures having short block length. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Barcelona, 2016. 655\u2013659","DOI":"10.1109\/ISIT.2016.7541380"},{"key":"2649_CR15","doi-asserted-by":"publisher","first-page":"3070","DOI":"10.1109\/TIT.2016.2518663","volume":"62","author":"I Tamo","year":"2016","unstructured":"Tamo I, Barg A, Frolov A. Bounds on the parameters of locally recoverable codes. IEEE Trans Inform Theory, 2016, 62: 3070\u20133083","journal-title":"IEEE Trans Inform Theory"},{"key":"2649_CR16","doi-asserted-by":"crossref","unstructured":"Prakash N, Lalitha V, Kumar P V. Codes with locality for two erasures. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Honolulu, 2014. 1962\u20131966","DOI":"10.1109\/ISIT.2014.6875176"},{"key":"2649_CR17","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010541","volume-title":"Handbook of Combinatorial Designs","author":"C J Colbourn","year":"2006","unstructured":"Colbourn C J, Dinitz J H. Handbook of Combinatorial Designs. 2nd ed. Boca Raton: CRC Press, 2006","edition":"2nd ed."},{"key":"2649_CR18","doi-asserted-by":"publisher","DOI":"10.1142\/7460","volume-title":"Design Theory","author":"Z X Wan","year":"2009","unstructured":"Wan Z X. Design Theory. Beijing: Higher Education Press, 2009"},{"key":"2649_CR19","doi-asserted-by":"crossref","unstructured":"Wang A, Zhang Z, Liu M. Achieving arbitrary locality and availability in binary codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Hong Kong, 2015. 1866\u20131870","DOI":"10.1109\/ISIT.2015.7282779"},{"key":"2649_CR20","doi-asserted-by":"crossref","unstructured":"Huang P, Yaakobi E, Uchikawa H, et al. Linear locally repairable codes with availability. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Hong Kong, 2015. 1871\u20131875","DOI":"10.1109\/ISIT.2015.7282780"},{"key":"2649_CR21","doi-asserted-by":"crossref","unstructured":"Olmez O, Ramamoorthy A. Repairable replication-based storage systems using resolvable designs. In: Proceedings of the 50th Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2012. 1174\u20131181","DOI":"10.1109\/Allerton.2012.6483351"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-2649-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-019-2649-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-2649-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T11:29:25Z","timestamp":1683890965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-019-2649-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,15]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["2649"],"URL":"https:\/\/doi.org\/10.1007\/s11432-019-2649-5","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,15]]},"assertion":[{"value":"23 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"122304"}}