{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:33:49Z","timestamp":1772120029608,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T00:00:00Z","timestamp":1675900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T00:00:00Z","timestamp":1675900800000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s12095-023-00626-6","type":"journal-article","created":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T09:00:55Z","timestamp":1675933255000},"page":"49-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On locality of binary distance-optimal codes"],"prefix":"10.1007","volume":"16","author":[{"given":"Ruipan","family":"Yang","sequence":"first","affiliation":[]},{"given":"Ruihu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Sen","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Rao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,9]]},"reference":[{"issue":"11","key":"626_CR1","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., Yekhanin, S.: On the locality of codeword symbols. IEEE Trans. Inf. Theory 58(11), 6925\u20136934 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"626_CR2","doi-asserted-by":"publisher","first-page":"596","DOI":"10.3390\/electronics8060596","volume":"8","author":"Y Kim","year":"2019","unstructured":"Kim, Y., Kim, C., No, J.: Overview of binary locally repairable codes for distributed storage systems. Electronics 8(6), 596 (2019)","journal-title":"Electronics"},{"key":"626_CR3","doi-asserted-by":"crossref","unstructured":"Hao, J., Xia, S.T., Chen, B.: Some results on optimal locally repairable codes, 2016 Int. Symp. Inf. Theory(ISIT):440\u2013444 (2016)","DOI":"10.1109\/ISIT.2016.7541337"},{"key":"626_CR4","doi-asserted-by":"crossref","unstructured":"Cadambe, V., Mazumdar, A.: An upper bound on the size of locally recoverable codes, 2013 Int. Symp. Netw. Coding(NetCod):1\u20135 (2013)","DOI":"10.1109\/NetCod.2013.6570829"},{"key":"626_CR5","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes, Online available at http:\/\/www.codetables.de, Accessed on 23rd Aug, 2022."},{"key":"626_CR6","doi-asserted-by":"crossref","unstructured":"Wang, A., Zhang, Z., Lin, D.: Bounds and constructions for linear locally repairable codes over binary fields, 2017 IEEE International Symposium on Information Theory(ISIT), 2033\u20132037 (2017)","DOI":"10.1109\/ISIT.2017.8006886"},{"issue":"7","key":"626_CR7","doi-asserted-by":"publisher","first-page":"4167","DOI":"10.1109\/TIT.2019.2895315","volume":"65","author":"A Wang","year":"2019","unstructured":"Wang, A., Zhang, Z., Lin, D.: Bounds for binary linear locally repairable codes via a sphere-packing approach. IEEE Trans. Inf. Theory 65(7), 4167\u20134179 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"626_CR8","doi-asserted-by":"crossref","unstructured":"Silberstein, N., Zeh, A.: Optimal binary locally repairable codes via anticodes, 2015 IEEE Int. Symp. Inf. Theory(ISIT), 1247\u20131251. (2015)","DOI":"10.1109\/ISIT.2015.7282655"},{"issue":"11","key":"626_CR9","doi-asserted-by":"publisher","first-page":"6268","DOI":"10.1109\/TIT.2016.2605119","volume":"62","author":"P Huang","year":"2016","unstructured":"Huang, P., Yaakobi, E., Uchikawa, H., Siegel, P.H.: Binary linear locally repairable code. IEEE Trans. Inf. Theory 62(11), 6268\u20136283 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"626_CR10","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/LCOMM.2019.2892950","volume":"23","author":"C Kim","year":"2019","unstructured":"Kim, C., No, J.S., Siegel, P.H.: New constructions of binary lrcs with disjoint repair groups and locality 3 using existing lrcs. IEEE Commun. Lett. 23 (3), 406\u2013409 (2019)","journal-title":"IEEE Commun. Lett."},{"key":"626_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.ffa.2017.08.013","volume":"48","author":"Q Fu","year":"2017","unstructured":"Fu, Q., Li, R., Guo, L., Lv, L.: Locality of optimal binary codes. Finite Fields Appl. 48, 371\u2013394 (2017)","journal-title":"Finite Fields Appl."},{"key":"626_CR12","volume-title":"Codes for Big Data Storage and Application","author":"Y Rao","year":"2017","unstructured":"Rao, Y.: Codes for Big Data Storage and Application. Air Force Engineering University, Master thesis(in Chinese) (2017)"},{"key":"626_CR13","doi-asserted-by":"publisher","first-page":"101793","DOI":"10.1016\/j.ffa.2020.101793","volume":"72","author":"R Li","year":"2021","unstructured":"Li, R., Yang, S., Rao, Y., Fu, Q.: On binary locally repairable codes with distance four. Finite Fields Appl. 72, 101793 (2021)","journal-title":"Finite Fields Appl."},{"key":"626_CR14","doi-asserted-by":"publisher","first-page":"41282","DOI":"10.1109\/ACCESS.2020.2974936","volume":"8","author":"S Yang","year":"2020","unstructured":"Yang, S., Li, R., Fu, Q., Lv, J.: New constructions of short length binary locally repairable codes. IEEE Access 8, 41282\u201341287 (2020)","journal-title":"IEEE Access"},{"key":"626_CR15","volume-title":"Research on Constructions of Binary Locally Repairable Codes","author":"S.Yang","year":"2020","unstructured":"S.Yang: Research on Constructions of Binary Locally Repairable Codes. Air Force Engineering University, Master thesis(in Chinese) (2020)"},{"issue":"12","key":"626_CR16","doi-asserted-by":"publisher","first-page":"7465","DOI":"10.1109\/TIT.2020.3021707","volume":"66","author":"J Hao","year":"2020","unstructured":"Hao, J., Xia, S., Shum, K.W., Chen, B.: Bounds and constructions of locally repairable codes: Parity-check matrix approach. IEEE Trans. Inf. Theory 66(12), 7465\u20137474 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"626_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0097-3165(78)90027-4","volume":"25","author":"N Hamada","year":"1978","unstructured":"Hamada, N., Tamari, F.: On a geometrical method of construction of maximal t-linearly independent sets. J. Comb. Theory Ser. A 25(1), 14\u201328 (1978)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"626_CR18","doi-asserted-by":"publisher","first-page":"2509","DOI":"10.1137\/19M1248443","volume":"33","author":"J Ma","year":"2019","unstructured":"Ma, J., Ge, G.: Optimal binary linear locally repairable codes with disjoint repair groups. SIAM J. Discret. Math. 33(4), 2509\u20132529 (2019)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00626-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00626-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00626-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T00:23:38Z","timestamp":1706919818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00626-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["626"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00626-6","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1988341\/v1","asserted-by":"object"}]},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,9]]},"assertion":[{"value":"23 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics approval and consent to participate"}},{"value":"All authors gave their consent for publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Consent for Publication"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}