{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T13:10:48Z","timestamp":1748437848219,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U2001203, 61871136","U2001203, 61871136","U2001203, 61871136"],"award-info":[{"award-number":["U2001203, 61871136","U2001203, 61871136","U2001203, 61871136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s12095-023-00681-z","type":"journal-article","created":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T10:01:59Z","timestamp":1699524119000},"page":"459-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Locally repairable codes with multiple repair sets based on packings of block size 4"],"prefix":"10.1007","volume":"16","author":[{"given":"Xiaopan","family":"Han","sequence":"first","affiliation":[]},{"given":"Guojun","family":"Han","sequence":"additional","affiliation":[]},{"given":"Han","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Linxin","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,9]]},"reference":[{"issue":"11","key":"681_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"},{"key":"681_CR2","doi-asserted-by":"publisher","unstructured":"Huang, C., Chen, M., Li, J.: Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. In: 6th IEEE International Symposium on Network Computing and Applications (NCA 2007), pp. 79\u201386 (2007). https:\/\/doi.org\/10.1109\/NCA.2007.37","DOI":"10.1109\/NCA.2007.37"},{"key":"681_CR3","unstructured":"Huang, C., Simitci, H., Xu, Y., Ogus, A., Calder, B., Gopalan, P., Li, J., Yekhanin, S.: Erasure coding in windows azure storage. In: Presented as part of the 2012 {USENIX} annual technical conference ({USENIX}{ATC} 12), pp. 15\u201326 (2012)"},{"key":"681_CR4","doi-asserted-by":"crossref","unstructured":"Prakash, N., Kamath, G.M., Lalitha, V., Kumar, P.V.: Optimal linear codes with a local-error-correction property. In: 2012 IEEE International symposium on information theory proceedings, pp. 2776\u20132780 (2012). IEEE","DOI":"10.1109\/ISIT.2012.6284028"},{"issue":"11","key":"681_CR5","doi-asserted-by":"publisher","first-page":"6979","DOI":"10.1109\/TIT.2014.2351404","volume":"60","author":"A Wang","year":"2014","unstructured":"Wang, A., Zhang, Z.: Repair locality with multiple erasure tolerance. IEEE Trans. Inf. Theory 60(11), 6979\u20136987 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"681_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TCOMM.2018.2869800","volume":"67","author":"H Cai","year":"2018","unstructured":"Cai, H., Cheng, M., Fan, C., Tang, X.: Optimal locally repairable systematic codes based on packings. IEEE Trans. Commun. 67(1), 39\u201349 (2018)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"681_CR7","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1109\/TIT.2019.2944397","volume":"66","author":"H Cai","year":"2019","unstructured":"Cai, H., Miao, Y., Schwartz, M., Tang, X.: On optimal locally repairable codes with multiple disjoint repair sets. IEEE Trans. Inf. Theory 66(4), 2402\u20132416 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"681_CR8","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1109\/TIT.2016.2524510","volume":"62","author":"AS Rawat","year":"2016","unstructured":"Rawat, A.S., Papailiopoulos, D.S., Dimakis, A.G., Vishwanath, S.: Locality and availability in distributed storage. IEEE Trans. Inf. Theory 62(8), 4481\u20134493 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"681_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2435204.2435207","volume":"9","author":"C Huang","year":"2013","unstructured":"Huang, C., Chen, M., Li, J.: Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. ACM Transactions on Storage (TOS) 9(1), 1\u201328 (2013)","journal-title":"ACM Transactions on Storage (TOS)"},{"issue":"1","key":"681_CR10","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","volume":"60","author":"AS Rawat","year":"2013","unstructured":"Rawat, A.S., Koyluoglu, O.O., Silberstein, N., Vishwanath, S.: Optimal locally repairable and secure codes for distributed storage systems. IEEE Trans. Inf. Theory 60(1), 212\u2013236 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"681_CR11","doi-asserted-by":"publisher","first-page":"3662","DOI":"10.1109\/TIT.2019.2891765","volume":"65","author":"V Guruswami","year":"2019","unstructured":"Guruswami, V., Xing, C., Yuan, C.: How long can optimal locally repairable codes be? IEEE Trans. Inf. Theory 65(6), 3662\u20133670 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"681_CR12","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo, I., Barg, A.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory 60(8), 4661\u20134676 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"681_CR13","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TIT.2020.3037268","volume":"67","author":"H Cai","year":"2020","unstructured":"Cai, H., Schwartz, M.: On optimal locally repairable codes and generalized sector-disk codes. IEEE Trans. Inf. Theory 67(2), 686\u2013704 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"681_CR14","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TIT.2021.3120016","volume":"68","author":"H Cai","year":"2021","unstructured":"Cai, H., Miao, Y., Schwartz, M., Tang, X.: A construction of maximally recoverable codes with order-optimal field size. IEEE Trans. Inf. Theory 68(1), 204\u2013212 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"681_CR15","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1007\/s10623-020-00728-9","volume":"88","author":"P Tan","year":"2020","unstructured":"Tan, P., Zhou, Z., Sidorenko, V., Parampalli, U.: Two classes of optimal lrcs with information (r, t)-locality. Des. Codes Crypt. 88(9), 1741\u20131757 (2020)","journal-title":"Des. Codes Crypt."},{"issue":"5","key":"681_CR16","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1109\/JSAC.2014.140521","volume":"32","author":"W Song","year":"2014","unstructured":"Song, W., Dau, S.H., Yuen, C., Li, T.J.: Optimal locally repairable linear codes. IEEE J Sel. Areas Commun. 32(5), 1019\u20131036 (2014)","journal-title":"IEEE J Sel. Areas Commun."},{"issue":"10","key":"681_CR17","doi-asserted-by":"publisher","first-page":"5296","DOI":"10.1109\/TIT.2016.2598149","volume":"62","author":"T Westerb\u00e4ck","year":"2016","unstructured":"Westerb\u00e4ck, T., Freij-Hollanti, R., Ernvall, T., Hollanti, C.: On the combinatorics of locally repairable codes via matroid theory. IEEE Trans. Inf. Theory 62(10), 5296\u20135315 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"681_CR18","doi-asserted-by":"publisher","first-page":"2499","DOI":"10.1109\/TIT.2017.2761120","volume":"64","author":"B Chen","year":"2017","unstructured":"Chen, B., Xia, S.-T., Hao, J., Fu, F.-W.: Constructions of optimal cyclic $$(r,{\\delta })$$ locally repairable codes. IEEE Trans. Inf. Theory 64(4), 2499\u20132511 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"681_CR19","doi-asserted-by":"publisher","first-page":"7790","DOI":"10.1109\/TIT.2019.2924888","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as, U., Kschischang, F.R.: Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes. IEEE Trans. Inf. Theory 65(12), 7790\u20137805 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"681_CR20","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. Inf. Theory 62(6), 3070\u20133083 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"681_CR21","doi-asserted-by":"publisher","first-page":"2332","DOI":"10.1109\/TCOMM.2017.2682861","volume":"65","author":"Y-S Su","year":"2017","unstructured":"Su, Y.-S.: On the construction of local parities for $$(r, t) $$-availability in distributed storage. IEEE Trans. Commun. 65(6), 2332\u20132344 (2017)","journal-title":"IEEE Trans. Commun."},{"issue":"6","key":"681_CR22","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. 20(6), 1060\u20131063 (2016)","journal-title":"IEEE Commun. Lett."},{"key":"681_CR23","unstructured":"Tang, D., Liu, J., Mesnager, S.: On constructions of binary locally repairable codes with locality two and multiple repair alternatives via autocorrelation spectra of boolean functions. In: The Twelfth International Workshop on Coding and Cryptography (WCC) (2022)"},{"issue":"6","key":"681_CR24","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/s12095-020-00424-4","volume":"12","author":"J Jiang","year":"2020","unstructured":"Jiang, J., Cheng, M.: Regular (k, r, 1)-packings with max (r)= 3 and their locally repairable codes. Crypt. Commun. 12(6), 1071\u20131089 (2020)","journal-title":"Crypt. Commun."},{"key":"681_CR25","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., Dinitz, J.H.: Handbook of combinatorial designs, 2nd Edn (Discrete Mathematics and Its Applications). Chapman & Hall\/CRC, (2007)","DOI":"10.1201\/9781420010541"},{"key":"681_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10623-003-6739-6","volume":"35","author":"G Ge","year":"2005","unstructured":"Ge, G., Lam, C.W., Ling, A.C., Shen, H.: Resolvable maximum packings with quadruples. Des. Codes Crypt. 35, 287\u2013302 (2005)","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"681_CR27","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/18.30982","volume":"35","author":"FR Chung","year":"1989","unstructured":"Chung, F.R., Salehi, J.A., Wei, V.K.: Optical orthogonal codes: design, analysis and applications. IEEE Trans. Inf. Theory 35(3), 595\u2013604 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"681_CR28","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/18.53748","volume":"36","author":"H Chung","year":"1990","unstructured":"Chung, H., Kumar, P.V.: Optical orthogonal codes-new bounds and an optimal construction. IEEE Trans. Inf. Theory 36(4), 866\u2013873 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"681_CR29","doi-asserted-by":"publisher","first-page":"1907","DOI":"10.1109\/TIT.2007.894658","volume":"53","author":"O Moreno","year":"2007","unstructured":"Moreno, O., Omrani, R., Kumar, P.V., Lu, H.-F.: A generalized bose-chowla family of optical orthogonal codes and distinct difference sets. IEEE Trans. Inf. Theory 53(5), 1907\u20131910 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"681_CR30","doi-asserted-by":"publisher","first-page":"3999","DOI":"10.1109\/TIT.2013.2247092","volume":"59","author":"J-H Chung","year":"2013","unstructured":"Chung, J.-H., Yang, K.: Asymptotically optimal optical orthogonal codes with new parameters. IEEE Trans. Inf. Theory 59(6), 3999\u20134005 (2013)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00681-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00681-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00681-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T09:12:44Z","timestamp":1713863564000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00681-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,9]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["681"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00681-z","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2023,11,9]]},"assertion":[{"value":"8 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 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":"The authors declared no potential conflict of interest with respect to the research, author-ship, and publication of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest\/Competing interests (check journal-specific guidelines for which heading to use)"}},{"value":"Both authors confirm that they have read and approved the manuscript. They further confirm that they have approved the order of authors listed in the manuscript of us. No experiment\/s was carried out on (i) live vertebrates (or higher invertebrates), (ii) humans or (iii) human samples that include an unambiguous statement within the method.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Written informed consent for participation of this paper was obtained from all authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors gave their consent for publication.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}