{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T12:04:30Z","timestamp":1777982670768,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"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":[[2026,3]]},"DOI":"10.1007\/s12095-025-00845-z","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T07:28:29Z","timestamp":1762154909000},"page":"367-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed repairing multiple erasures in Reed-Solomon codes"],"prefix":"10.1007","volume":"18","author":[{"given":"Xing","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,3]]},"reference":[{"key":"845_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9482-6","volume":"61","author":"SB Balaji","year":"2018","unstructured":"Balaji, S.B., Krishnan, M.N., Vajha, M., Ramkumar, V., Sasidharan, B., Kumar, P.V.: Erasure coding for distributed storage: an overview. SCIENCE CHINA Inf. Sci. 61, 100301 (2018)","journal-title":"SCIENCE CHINA Inf. Sci."},{"key":"845_CR2","doi-asserted-by":"crossref","unstructured":"Liu, S., Oggier, F.: An overview of coding for distributed storage systems. In: Network Coding and Subspace Designs, pp. 363-383. Springer (2018)","DOI":"10.1007\/978-3-319-70293-3_14"},{"key":"845_CR3","doi-asserted-by":"crossref","unstructured":"Dimakis A.G., Godfrey P., Wainwright M., Ramchandran K.: Network coding for distributed storage systems. In: Proc. IEEE Int. Conf. Comput. Commun. (INFOCOM), pp. 2000-2008 (2007)","DOI":"10.1109\/INFCOM.2007.232"},{"issue":"9","key":"845_CR4","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainwright, M.J.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539\u20134551 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"845_CR5","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"KV Rashmi","year":"2011","unstructured":"Rashmi, K.V., Shah, N.B., Kumar, P.V.: Optimal exact-regenerating codes for distributed storage at the msr and mbr points via a product-matrix construction. IEEE Trans. Inf. Theory 57(8), 5227\u20135239 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"845_CR6","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TIT.2012.2227110","volume":"59","author":"I Tamo","year":"2013","unstructured":"Tamo, I., Wang, Z., Bruck, J.: Zigzag codes: mds array codes with optimal rebuilding. IEEE Trans. Inf. Theory 59(3), 1597\u20131616 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"845_CR7","doi-asserted-by":"publisher","first-page":"3021","DOI":"10.1109\/TIT.2013.2241819","volume":"59","author":"DS Papailiopoulos","year":"2013","unstructured":"Papailiopoulos, D.S., Dimakis, A.G., Cadambe, V.R.: Repair optimal erasure codes through hadamard designs. IEEE Trans. Inf. Theory 59(5), 3021\u20133037 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"845_CR8","doi-asserted-by":"publisher","first-page":"4466","DOI":"10.1109\/TIT.2016.2553675","volume":"62","author":"Z Wang","year":"2016","unstructured":"Wang, Z., Tamo, I., Bruck, J.: Explicit minimum storage regenerating codes. IEEE Trans. Inf. Theory 62(8), 4466\u20134480 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"845_CR9","doi-asserted-by":"crossref","unstructured":"Sasidharan B., Vajha M., Kumar P.V.: An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and all-node repair (2016). arXiv preprint arXiv:1607.07335","DOI":"10.1109\/ISIT.2017.8006889"},{"issue":"4","key":"845_CR10","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1109\/TIT.2017.2661313","volume":"63","author":"M Ye","year":"2017","unstructured":"Ye, M., Barg, A.: Explicit constructions of high-rate mds array codes with optimal repair bandwidth. IEEE Trans. Inf. Theory 63(4), 2001\u20132014 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"845_CR11","doi-asserted-by":"publisher","first-page":"6307","DOI":"10.1109\/TIT.2017.2730863","volume":"67","author":"M Ye","year":"2017","unstructured":"Ye, M., Barg, A.: Explicit constructions of optimal-access mds codes with nearly optimal sub-packetization. IEEE Trans. Inf. Theory 67(10), 6307\u20136317 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"845_CR12","doi-asserted-by":"crossref","unstructured":"Li J., Tang X., Tian C.: A generic transformation for optimal repair bandwidth and rebuilding access in MDS codes. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 1623\u20131627 (2017)","DOI":"10.1109\/ISIT.2017.8006804"},{"key":"845_CR13","doi-asserted-by":"crossref","unstructured":"Wang, N., Li, G., Hu, S., Ye, M.: Constructing msr codes with subpacketization $$2^{n\/3}$$ for $$k+1$$ helper nodes. IEEE Trans. Inf. Theory 69(6), 3775\u20133792 (2023)","DOI":"10.1109\/TIT.2023.3238759"},{"key":"845_CR14","doi-asserted-by":"crossref","unstructured":"Vajha, M., Balaji, S.B., Kumar, P.V.: Small-$$d$$ msr codes with optimal access, optimal sub-packetization and linear field size. IEEE Trans. Inf. Theory 69(7), 4303\u20134332 (2023)","DOI":"10.1109\/TIT.2023.3250458"},{"key":"845_CR15","doi-asserted-by":"crossref","unstructured":"Li G., Wang N., Hu S., Ye M.: MSR codes with linear field size and smallest sub-packetization for any number of helper nodes (2023). arXiv preprint arXiv:2303.10467v3","DOI":"10.1109\/ISIT57864.2024.10619086"},{"key":"845_CR16","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1134\/S1064226920120116","volume":"65","author":"S Kruglik","year":"2020","unstructured":"Kruglik, S.: Frolov, a: an information-theoretic approach for reliable distributed storage systems. J. Commun. Technol. Electron. 65, 1505\u20131516 (2020)","journal-title":"J. Commun. Technol. Electron."},{"issue":"2","key":"845_CR17","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"845_CR18","unstructured":"Fikes A.: Colossus, successor to google file system. Available: http:\/\/static.googleusercontent.com\/media\/research.google.com\/en\/us\/university\/relations\/facultysummit2010\/"},{"key":"845_CR19","unstructured":"Li R., Zhang Z., Zheng K., Wang A.: Progress report: bringing erasure coding to Apache Hadoop. Available: http:\/\/blog.cloudera.com\/blog\/2016\/02\/progress-report-bringing-erasure-coding-to-apache-hadoop\/"},{"key":"845_CR20","doi-asserted-by":"crossref","unstructured":"Lai C., Jiang S., Yang L., Lin S., Sun G., Hou Z., Cui C., Cong J.: Atlas: baidu\u2019s key-value storage system for cloud data. In: Proceedings Symposium Mass Stor System Technology (MSST), pp. 1\u201314 (2015)","DOI":"10.1109\/MSST.2015.7208288"},{"issue":"12","key":"845_CR21","doi-asserted-by":"publisher","first-page":"3433","DOI":"10.1109\/TPDS.2014.2377720","volume":"26","author":"S Fu","year":"2015","unstructured":"Fu, S., He, L., Huang, C., Liao, X., Li, K.: Performance optimization for managing massive numbers of small files in distributed file systems. IEEE Trans. Parallel Distrib. Syst. 26(12), 3433\u20133448 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"845_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1165389.945450","volume":"37","author":"S Ghemawat","year":"2003","unstructured":"Ghemawat, S., Gobioff, H., Leung, S.-T.: The google file system. ACM SIGOPS Operating Systems Review 37(5), 29\u201343 (2003)","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"9","key":"845_CR23","first-page":"5684","volume":"63","author":"V Guruswami","year":"2017","unstructured":"Guruswami, V., Wootters, M.: Repairing reed-solomon codes. IEEE Trans. Inf. Theory 63(9), 5684\u20135698 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"845_CR24","doi-asserted-by":"crossref","unstructured":"Ye M., Barg A.: Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 1202\u20131206 (2016)","DOI":"10.1109\/ISIT.2016.7541489"},{"key":"845_CR25","doi-asserted-by":"crossref","unstructured":"Dau H., Milenkovic O.: Optimal repair schemes for some families of full-length reed-solomon codes. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 346\u2013350 (2017)","DOI":"10.1109\/ISIT.2017.8006547"},{"key":"845_CR26","doi-asserted-by":"crossref","unstructured":"Li W., Wang Z., Jafarkhani H.: A tradeoff between the sub-packetization size and the repair bandwidth for Reed-Solomon code. In: Proceedings Annual Allerton Conference, pp. 942\u2013949 (2017)","DOI":"10.1109\/ALLERTON.2017.8262839"},{"key":"845_CR27","doi-asserted-by":"crossref","unstructured":"Tamo I., Ye M., Barg A.: Optimal repair of Reed-Solomon codes: achieving the cut-set bound. In: Proc. IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 216\u2013227 (2017)","DOI":"10.1109\/FOCS.2017.28"},{"key":"845_CR28","doi-asserted-by":"crossref","unstructured":"Duursma I., Dau H.: Low bandwidth repair of the RS(10,4) Reed-Solomon code. In: Proceedings Information Theory and Applications Workshop (ITA), pp. 1\u201310 (2017)","DOI":"10.1109\/ITA.2017.8023449"},{"key":"845_CR29","doi-asserted-by":"crossref","unstructured":"Dau H., Duursma I., Chu H.: On the I\/O costs of some repair schemes for full-length Reed-Solomon codes. In: Proceedings IEEE International Symposium Information Theory (ISIT), pp. 1700\u20131704 (2018)","DOI":"10.1109\/ISIT.2018.8437865"},{"key":"845_CR30","doi-asserted-by":"crossref","unstructured":"Dau H., Viterbo E.: Repair schemes with optimal I\/O costs for full-length Reed-Solomon codes with two parities. In: Proceedings IEEE Information Theory Workshop (ITW), pp. 590\u2013594 (2018)","DOI":"10.1109\/ITW.2018.8613326"},{"key":"845_CR31","doi-asserted-by":"crossref","unstructured":"Li, W., Wang, Z., Jafarkhani, H.: Repairing reed-solomon codes over $$gf(2^{l})$$. IEEE Comm. Lett. 24(1), 34\u201337 (2020)","DOI":"10.1109\/LCOMM.2019.2950922"},{"issue":"12","key":"845_CR32","doi-asserted-by":"publisher","first-page":"7439","DOI":"10.1109\/TIT.2020.3017666","volume":"66","author":"Z Chen","year":"2020","unstructured":"Chen, Z., Ye, M., Barg, A.: Enabling optimal access and error correction for the repair of reed-solomon codes. IEEE Trans. Inf. Theory 66(12), 7439\u20137456 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"845_CR33","doi-asserted-by":"crossref","unstructured":"Berman A., Buzaglo S., Dor A., Shany Y., Tamo I.: Repairing Reed-Solomon codes evaluated on subspaces. In: Proceedings IEEE International Symposium Information Theory (ISIT), pp. 867-871 (2021)","DOI":"10.1109\/ISIT45174.2021.9517961"},{"issue":"8","key":"845_CR34","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/TIT.2021.3071447","volume":"67","author":"A Chowdhury","year":"2021","unstructured":"Chowdhury, A., Vardy, A.: Improved schemes for asymptotically optimal repair of mds codes. IEEE Trans. Inf. Theory 67(8), 5051\u20135068 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"845_CR35","doi-asserted-by":"crossref","unstructured":"Dinh T.X., Nguyen N.L.Y., Mohan L.J., Boztas S., Luong T.T., Dau S.H.: Practical considerations in repairing reed-solomon codes. In: Processing IEEE International Symposium Information Theory (ISIT), pp. 2607\u20132612 (2022)","DOI":"10.1109\/ISIT50566.2022.9834830"},{"issue":"10","key":"845_CR36","doi-asserted-by":"publisher","first-page":"6505","DOI":"10.1109\/TIT.2022.3177903","volume":"68","author":"A Berman","year":"2022","unstructured":"Berman, A., Buzaglo, S., Dor, A., Shany, Y., Tamo, I.: Repairing reed-solomon codes evaluated on subspaces. IEEE Trans. Inform. Theory 68(10), 6505\u20136515 (2022)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"845_CR37","doi-asserted-by":"publisher","first-page":"2924","DOI":"10.1109\/LCOMM.2023.3319653","volume":"27","author":"X Lin","year":"2023","unstructured":"Lin, X.: A note on bandwidth-optimal repair scheme for reed-solomon codes with low repair locality. IEEE Commun. Lett. 27(11), 2924\u20132927 (2023)","journal-title":"IEEE Commun. Lett."},{"issue":"8","key":"845_CR38","doi-asserted-by":"publisher","first-page":"5165","DOI":"10.1109\/TIT.2022.3167615","volume":"68","author":"R Con","year":"2022","unstructured":"Con, R., Tamo, I.: Nonlinear repair schemes of reed-solomon codes. IEEE Trans. Inform. Theory 68(8), 5165\u20135177 (2022)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"845_CR39","doi-asserted-by":"publisher","first-page":"5552","DOI":"10.1109\/TIT.2024.3366817","volume":"70","author":"HM Kiah","year":"2024","unstructured":"Kiah, H.M., Kim, W., Kruglik, S., Ling, S., Wang, H.: Explicit low-bandwidth evaluation schemes for weighted sums of reed-solomon-coded symbols. IEEE Trans. Inform. Theory 70(8), 5552\u20135565 (2024)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"845_CR40","unstructured":"Ford D., Labelle F., Popovici F., Stokely M., Truong V., Barroso L., Grimes C., Quinlan S.: Availability in globally distributed storage systems. In: Processing USENIX Symposium Operator System Design Implementation (OSDI), pp. 61\u201374 (2010)"},{"key":"845_CR41","unstructured":"Bhagwan R., Tati K., Cheng Y.-C., Savage S., Voelker G.M.: Total recall: system support for automated availability managemen. In: Processing USENIX Symposium Network System Design Implementation (NSDI), pp. 337\u2013350 (2004)"},{"issue":"5","key":"845_CR42","doi-asserted-by":"publisher","first-page":"2673","DOI":"10.1109\/TIT.2018.2884075","volume":"65","author":"I Tamo","year":"2019","unstructured":"Tamo, I., Ye, M., Barg, A.: The repair problem for reed-solomon codes: optimal repair of single and multiple erasures with almost optimal node size. IEEE Trans. Inf. Theory 65(5), 2673\u20132695 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"845_CR43","doi-asserted-by":"publisher","first-page":"2661","DOI":"10.1109\/TIT.2018.2876542","volume":"65","author":"J Mardia","year":"2019","unstructured":"Mardia, J., Bartany, B., Wootters, M.: Repairing multiple failures for scalar mds codes. IEEE Trans. Inf. Theory 65(5), 2661\u20132672 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"845_CR44","doi-asserted-by":"publisher","first-page":"5484","DOI":"10.1109\/TIT.2019.2917425","volume":"65","author":"W Li","year":"2019","unstructured":"Li, W., Wang, Z., Jafarkhani, H.: On the sub-packetization size and the repair bandwidth of reed-solomon codes. IEEE Trans. Inf. Theory 65(9), 5484\u20135502 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"845_CR45","doi-asserted-by":"crossref","unstructured":"Dinh T.X., Boztas S., Dau S.H., Viterbo E.: Designing compact repair groups for Reed-Solomon codes. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 2027\u20132032 (2023)","DOI":"10.1109\/ISIT54713.2023.10206491"},{"issue":"10","key":"845_CR46","doi-asserted-by":"publisher","first-page":"6567","DOI":"10.1109\/TIT.2018.2827942","volume":"54","author":"H Dau","year":"2018","unstructured":"Dau, H., Duursma, I., Kiah, H.M., Milenkovic, O.: Repairing reed-solomon codes with multiple erasures. IEEE Trans. Inf. Theory 54(10), 6567\u20136582 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"845_CR47","doi-asserted-by":"crossref","unstructured":"Zhang Y., Zhang Z.: An improved cooperative repair scheme for Reed-Solomon codes. In: Processing International Symposium Communication Information Technology (ISCIT), pp. 525\u2013530 (2019)","DOI":"10.1109\/ISCIT.2019.8905159"},{"issue":"10","key":"845_CR48","doi-asserted-by":"publisher","first-page":"6395","DOI":"10.1109\/TIT.2021.3071878","volume":"67","author":"SH Dau","year":"2021","unstructured":"Dau, S.H., Dinh, T.X., Kiah, H.M., Luong, T.T., Milenkovic, O.: Repairing reed-solomon codes via subspace polynomials. IEEE Trans. Inf. Theory 67(10), 6395\u20136407 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"845_CR49","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1109\/TIT.2023.3347654","volume":"70","author":"J Xu","year":"2024","unstructured":"Xu, J., Zhang, Y., Wang, K., Zhang, Z.: Cooperative repair of reed-solomon codes via linearized permutation polynomials. IEEE Trans. Inf. Theory 70(7), 4747\u20134758 (2024)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"845_CR50","unstructured":"MacWilliams F.J., Sloane N.J.: The theory of error-correcting codes. Elsevier (1977)"},{"key":"845_CR51","unstructured":"Lidl R., Niederreiter H.: Introduction to finite fields and their applications. Cambridge University Press (1986)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00845-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-025-00845-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00845-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:11:25Z","timestamp":1775038285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-025-00845-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,3]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["845"],"URL":"https:\/\/doi.org\/10.1007\/s12095-025-00845-z","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.24524944.v2","asserted-by":"object"}]},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,3]]},"assertion":[{"value":"5 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","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 have no relevant financial or non-financial interests to disclose. The authors have no competing interests to declare that are relevant to the content of this article. All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript. The authors have no financial or proprietary interests in any material discussed in this article. Authors are responsible for correctness of the statements provided in the manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}