{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T12:01:35Z","timestamp":1777982495601,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10623-025-01679-9","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T11:10:39Z","timestamp":1751541039000},"page":"4293-4312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Distributed repair schemes for Reed\u2013Solomon codes with multiple erasures"],"prefix":"10.1007","volume":"93","author":[{"given":"Xing","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"key":"1679_CR1","doi-asserted-by":"crossref","unstructured":"Berman A., Buzaglo S., Dor A., Shany Y., Tamo I.: Repairing Reed\u2013Solomon codes evaluated on subspaces. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 867\u2013871 (2021).","DOI":"10.1109\/ISIT45174.2021.9517961"},{"key":"1679_CR2","unstructured":"Bhagwan R., Tati K., Cheng Y.-C., Savage S., Voelker G.M.: Total recall: system support for automated availability management. In: Proc. USENIX Symp. Net. Syst. Des. Implementation (NSDI), pp. 337\u2013350 (2004)."},{"issue":"12","key":"1679_CR3","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\u2013Solomon codes. IEEE Trans. Inf. Theory 66(12), 7439\u20137456 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1679_CR4","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":"1679_CR5","doi-asserted-by":"crossref","unstructured":"Dau H., Duursma I., Chu H.: On the I\/O costs of some repair schemes for full-length Reed\u2013Solomon codes. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 1700\u20131704 (2018).","DOI":"10.1109\/ISIT.2018.8437865"},{"key":"1679_CR6","doi-asserted-by":"crossref","unstructured":"Dau H., Milenkovic O.: Optimal repair schemes for some families of full-length Reed\u2013Solomon codes. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 346\u2013350 (2017).","DOI":"10.1109\/ISIT.2017.8006547"},{"key":"1679_CR7","doi-asserted-by":"crossref","unstructured":"Dau H., Viterbo E.: Repair schemes with optimal I\/O costs for full-length Reed\u2013Solomon codes with two parities. In: Proc. IEEE Inform. Theory Workshop (ITW), pp. 590\u2013594 (2018).","DOI":"10.1109\/ITW.2018.8613326"},{"issue":"10","key":"1679_CR8","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\u2013Solomon codes via subspace polynomials. IEEE Trans. Inf. Theory 67(10), 6395\u20136407 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1679_CR9","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\u2013Solomon codes with multiple erasures. IEEE Trans. Inf. Theory 54(10), 6567\u20136582 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1679_CR10","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":"1679_CR11","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"},{"key":"1679_CR12","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\u2013Solomon codes. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 2607\u20132612 (2022).","DOI":"10.1109\/ISIT50566.2022.9834830"},{"key":"1679_CR13","doi-asserted-by":"crossref","unstructured":"Duursma I., Dau H.: Low bandwidth repair of the RS(10,4) Reed\u2013Solomon code. In: Proc. Information Theory and Applications Workshop (ITA), pp. 1\u201310 (2017).","DOI":"10.1109\/ITA.2017.8023449"},{"key":"1679_CR14","unstructured":"Fikes A.: Colossus, successor to google file system. http:\/\/static.googleusercontent.com\/media\/research.google.com\/en\/us\/university\/relations\/facultysummit2010\/storagearchitectureandchallenges.pdf."},{"key":"1679_CR15","unstructured":"Ford D., Labelle F., Popovici F., Stokely M., Truong V., Barroso L., Grimes C., Quinlan S.: Availability in globally distributed storage systems. In: Proc. USENIX Symp. Oper. Syst. Des. Implementation (OSDI), pp. 61\u201374 (2010)."},{"issue":"9","key":"1679_CR16","first-page":"5684","volume":"63","author":"V Guruswami","year":"2017","unstructured":"Guruswami V., Wootters M.: Repairing Reed\u2013Solomon codes. IEEE Trans. Inf. Theory 63(9), 5684\u20135698 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1679_CR17","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: Proc. Symp. Mass Stor. Syst. Tech.(MSST), pp. 1\u201314 (2015).","DOI":"10.1109\/MSST.2015.7208288"},{"key":"1679_CR18","doi-asserted-by":"crossref","unstructured":"Li W., Wang Z., Jafarkhani H.: A tradeoff between the sub-packetization size and the repair bandwidth for Reed\u2013Solomon code. In: Proc. Annual Allerton Conference, pp. 942\u2013949 (2017).","DOI":"10.1109\/ALLERTON.2017.8262839"},{"key":"1679_CR19","unstructured":"Li R., Zhang Z., Zheng K., Wang A.: Progress report: bringing erasure coding to Apache Hadoop. http:\/\/blog.cloudera.com\/blog\/2016\/02\/progress-report-bringing-erasure-coding-to-apache-hadoop\/."},{"issue":"9","key":"1679_CR20","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"},{"issue":"1","key":"1679_CR21","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/LCOMM.2019.2950922","volume":"24","author":"W Li","year":"2020","unstructured":"Li W., Wang Z., Jafarkhani H.: Repairing Reed\u2013Solomon codes over $$GF(2^l)$$. IEEE Commun. Lett. 24(1), 34\u201337 (2020).","journal-title":"IEEE Commun. Lett."},{"key":"1679_CR22","volume-title":"Introduction to Finite Fields and Their Applications","author":"R Lidl","year":"1986","unstructured":"Lidl R., Niederreiter H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1986)."},{"key":"1679_CR23","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.: The Theory of Error-Correcting Codes. Elsevier, Amsterdam (1977)."},{"issue":"5","key":"1679_CR24","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., Woottersz M.: Repairing multiple failures for scalar MDS codes. IEEE Trans. Inf. Theory 65(5), 2661\u20132672 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1679_CR25","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":"1679_CR26","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"},{"issue":"5","key":"1679_CR27","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\u2013Solomon 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"},{"key":"1679_CR28","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":"1679_CR29","doi-asserted-by":"crossref","unstructured":"Zhang Y., Zhang Z.: An improved cooperative repair scheme for Reed\u2013Solomon codes. In: Proc. Int. Symp. Comm. Inform. Tech. (ISCIT), pp. 525\u2013530 (2019).","DOI":"10.1109\/ISCIT.2019.8905159"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01679-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01679-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01679-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T18:03:13Z","timestamp":1760551393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01679-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,3]]},"references-count":29,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1679"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01679-9","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.24474205.v2","asserted-by":"object"},{"id-type":"doi","id":"10.36227\/techrxiv.24474205.v1","asserted-by":"object"}]},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,3]]},"assertion":[{"value":"26 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":4,"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 Conflict of interest 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":"Conflict of interest"}}]}}