{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:39:50Z","timestamp":1764686390614,"version":"3.46.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s11704-024-3581-7","type":"journal-article","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:37:24Z","timestamp":1764686244000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MDS array codes with low disk I\/O and small repair bandwidth"],"prefix":"10.1007","volume":"20","author":[{"given":"Lei","family":"Li","sequence":"first","affiliation":[]},{"given":"Chenhao","family":"Ying","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yuanyuan","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"3581_CR1","first-page":"29","volume-title":"Proceedings of the 19th ACM Symposium on Operating Systems Principles","author":"S Ghemawat","year":"2003","unstructured":"Ghemawat S, Gobioff H, Leung S T. The Google file system. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles. 2003, 29\u201343"},{"key":"3581_CR2","first-page":"1","volume-title":"Proceedings of the 26th IEEE Symposium on Mass Storage Systems and Technologies","author":"K Shvachko","year":"2010","unstructured":"Shvachko K, Kuang H, Radia S, Chansler R. The Hadoop distributed file system. In: Proceedings of the 26th IEEE Symposium on Mass Storage Systems and Technologies. 2010, 1\u201310"},{"key":"3581_CR3","first-page":"15","volume-title":"Proceedings of 2012 USENIX conference on Annual Technical Conference","author":"C Huang","year":"2012","unstructured":"Huang C, Simitci H, Xu Y, Ogus A, Calder B, Gopalan P, Li J, Yekhanin S. Erasure coding in windows azure storage. In: Proceedings of 2012 USENIX conference on Annual Technical Conference. 2012, 15\u201326"},{"key":"3581_CR4","volume-title":"The Theory of Error-Correcting Codes","author":"F J MacWilliams","year":"1977","unstructured":"MacWilliams F J, Sloane N J A. The Theory of Error-Correcting Codes. Amsterdam: Elsevier, 1977"},{"issue":"2","key":"3581_CR5","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I S Reed","year":"1960","unstructured":"Reed I S, Solomon G. Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics, 1960, 8(2): 300\u2013304","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"9","key":"3581_CR6","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, Wainwright M J, Ramchandran K. Network coding for distributed storage systems. IEEE Transactions on Information Theory, 2010, 56(9): 4539\u20134551","journal-title":"IEEE Transactions on Information Theory"},{"key":"3581_CR7","volume-title":"Proceedings of the 5th USENIX Conference on Hot Topics in Storage and File Systems","author":"K V Rashmi","year":"2013","unstructured":"Rashmi K V, Shah N B, Gu D, Kuang H, Borthakur D, Ramchandran K. A solution to the network challenges of data recovery in erasure-coded distributed storage systems: a study on the Facebook warehouse cluster. In: Proceedings of the 5th USENIX Conference on Hot Topics in Storage and File Systems. 2013"},{"issue":"10","key":"3581_CR8","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, Ramkumar V, Sasidharan B, Kumar P V. Erasure coding for distributed storage: an overview. Science China Information Sciences, 2018, 61(10): 100301","journal-title":"Science China Information Sciences"},{"issue":"2","key":"3581_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/JSAC.2010.100217","volume":"28","author":"Y Wu","year":"2010","unstructured":"Wu Y. Existence and construction of capacity-achieving network codes for distributed storage. IEEE Journal on Selected Areas in Communications, 2010, 28(2): 277\u2013288","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"3581_CR10","first-page":"2276","volume-title":"Proceedings of 2009 IEEE International Symposium on Information Theory","author":"Y Wu","year":"2009","unstructured":"Wu Y, Dimakis A G. Reducing repair traffic for erasure coding-based storage via interference alignment. In: Proceedings of 2009 IEEE International Symposium on Information Theory. 2009, 2276\u20132280"},{"key":"3581_CR11","first-page":"1243","volume-title":"Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing","author":"K V Rashmi","year":"2009","unstructured":"Rashmi K V, Shah N B, Kumar P V, Ramchandran K. Explicit construction of optimal exact regenerating codes for distributed storage. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing. 2009, 1243\u20131249"},{"key":"3581_CR12","first-page":"161","volume-title":"Proceedings of 2010 IEEE International Symposium on Information Theory","author":"C Suh","year":"2010","unstructured":"Suh C, Ramchandran K. Exact-repair MDS codes for distributed storage using interference alignment. In: Proceedings of 2010 IEEE International Symposium on Information Theory. 2010, 161\u2013165"},{"issue":"8","key":"3581_CR13","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"K V 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 Transactions on Information Theory, 2011, 57(8): 5227\u20135239","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"3581_CR14","doi-asserted-by":"publisher","first-page":"2974","DOI":"10.1109\/TIT.2013.2237752","volume":"59","author":"V R Cadambe","year":"2013","unstructured":"Cadambe V R, Jafar S A, Maleki H, Ramchandran K, Suh C. Asymptotic interference alignment for optimal repair of MDS codes in distributed storage. IEEE Transactions on Information Theory, 2013, 59(5): 2974\u20132987","journal-title":"IEEE Transactions on Information Theory"},{"key":"3581_CR15","first-page":"1225","volume-title":"Proceedings of 2011 IEEE International Symposium on Information Theory Proceedings","author":"V R Cadambe","year":"2011","unstructured":"Cadambe V R, Huang C, Li J. Permutation code: optimal exact-repair of a single failed node in MDS code based distributed storage systems. In: Proceedings of 2011 IEEE International Symposium on Information Theory Proceedings. 2011, 1225\u20131229"},{"issue":"3","key":"3581_CR16","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 Transactions on Information Theory, 2013, 59(3): 1597\u20131616","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"3581_CR17","doi-asserted-by":"publisher","first-page":"2028","DOI":"10.1109\/TIT.2014.2305698","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo I, Wang Z, Bruck J. Access versus bandwidth in codes for storage. IEEE Transactions on Information Theory, 2014, 60(4): 2028\u20132037","journal-title":"IEEE Transactions on Information Theory"},{"key":"3581_CR18","first-page":"2051","volume-title":"Proceedings of 2015 IEEE International Symposium on Information Theory","author":"B Sasidharan","year":"2015","unstructured":"Sasidharan B, Agarwal G K, Kumar P V. A high-rate MSR code with polynomial sub-packetization level. In: Proceedings of 2015 IEEE International Symposium on Information Theory. 2015, 2051\u20132055"},{"key":"3581_CR19","first-page":"1","volume-title":"Proceedings of 2016 Information Theory and Applications Workshop","author":"A S Rawat","year":"2016","unstructured":"Rawat A S, Koyluoglu O O, Vishwanath S. Progress on high-rate MSR codes: enabling arbitrary number of helper nodes. In: Proceedings of 2016 Information Theory and Applications Workshop. 2016, 1\u20136"},{"issue":"4","key":"3581_CR20","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 Transactions on Information Theory, 2017, 63(4): 2001\u20132014","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"3581_CR21","doi-asserted-by":"publisher","first-page":"6307","DOI":"10.1109\/TIT.2017.2730863","volume":"63","author":"M Ye","year":"2017","unstructured":"Ye M, Barg A. Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization. IEEE Transactions on Information Theory, 2017, 63(10): 6307\u20136317","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"3581_CR22","doi-asserted-by":"publisher","first-page":"6452","DOI":"10.1109\/TIT.2022.3180034","volume":"68","author":"S B Balaji","year":"2022","unstructured":"Balaji S B, Vajha M, Kumar P V. Lower bounds on the sub-packetization level of MSR codes and characterizing optimal-access MSR codes achieving the bound. IEEE Transactions on Information Theory, 2022, 68(10): 6452\u20136471","journal-title":"IEEE Transactions on Information Theory"},{"key":"3581_CR23","first-page":"2048","volume-title":"Proceedings of 2017 IEEE International Symposium on Information Theory","author":"B Sasidharan","year":"2017","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 d<(n-1). In: Proceedings of 2017 IEEE International Symposium on Information Theory. 2017, 2048\u20132052"},{"issue":"9","key":"3581_CR24","doi-asserted-by":"publisher","first-page":"6257","DOI":"10.1109\/TIT.2018.2855059","volume":"64","author":"J Li","year":"2018","unstructured":"Li J, Tang X, Tian C. A generic transformation to enable optimal repair in MDS codes for distributed storage systems. IEEE Transactions on Information Theory, 2018, 64(9): 6257\u20136267","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"3581_CR25","doi-asserted-by":"publisher","first-page":"4303","DOI":"10.1109\/TIT.2023.3250458","volume":"69","author":"M Vajha","year":"2023","unstructured":"Vajha M, Balaji S, Kumar P V. Small-d MSR codes with optimal access, optimal sub-packetization, and linear field size. IEEE Transactions on Information Theory, 2023, 69(7): 4303\u20134332","journal-title":"IEEE Transactions on Information Theory"},{"key":"3581_CR26","first-page":"139","volume-title":"Proceedings of the 16th USENIX Conference on File and Storage Technologies","author":"M Vajha","year":"2018","unstructured":"Vajha M, Ramkumar V, Puranik B, Kini G, Lobo E, Sasidharan B, Kumar P V, Barg A, Ye M, Narayanamurthy S, Hussain S, Nandi S. Clay codes: moulding MDS codes to yield an MSR code. In: Proceedings of the 16th USENIX Conference on File and Storage Technologies. 2018, 139\u2013154"},{"issue":"1","key":"3581_CR27","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s11704-017-6523-9","volume":"13","author":"C Li","year":"2019","unstructured":"Li C, Feng D, Hua Y, Wang F. A high-performance and endurable SSD cache for parity-based RAID. Frontiers of Computer Science, 2019, 13(1): 16\u201334","journal-title":"Frontiers of Computer Science"},{"key":"3581_CR28","first-page":"81","volume-title":"Proceedings of the 14th USENIX Conference on File and Storage Technologies","author":"L Pamies-Juarez","year":"2016","unstructured":"Pamies-Juarez L, Blagojevic F, Mateescu R, Gyuot C, En Gad E, Bandic Z. Opening the chrysalis: on the real repair performance of MSR codes. In: Proceedings of the 14th USENIX Conference on File and Storage Technologies. 2016, 81\u201394"},{"issue":"4","key":"3581_CR29","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/TBDATA.2017.2749255","volume":"4","author":"K Kralevska","year":"2018","unstructured":"Kralevska K, Gligoroski D, Jensen R E, \u00d8verby H. Hashtag erasure codes: from theory to practice. IEEE Transactions on Big Data, 2018, 4(4): 516\u2013529","journal-title":"IEEE Transactions on Big Data"},{"issue":"9","key":"3581_CR30","first-page":"5802","volume":"63","author":"K V Rashmi","year":"2017","unstructured":"Rashmi K V, Shah N B, Ramchandran K. A piggybacking design framework for read-and download-efficient distributed storage codes. IEEE Transactions on Information Theory, 2017, 63(9): 5802\u20135820","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"3581_CR31","doi-asserted-by":"publisher","first-page":"2099","DOI":"10.1109\/LCOMM.2021.3071855","volume":"25","author":"R Sun","year":"2021","unstructured":"Sun R, Zhang L, Liu J. A new piggybacking design with low-repair bandwidth and complexity. IEEE Communications Letters, 2021, 25(7): 2099\u20132103","journal-title":"IEEE Communications Letters"},{"key":"3581_CR32","first-page":"2601","volume-title":"Proceedings of 2022 IEEE International Symposium on Information Theory","author":"H Shi","year":"2022","unstructured":"Shi H, Hou H, Han Y S, Lee P P C, Jiang Z, Huang Z, Bai B. New piggybacking codes with lower repair bandwidth for any single-node failure. In: Proceedings of 2022 IEEE International Symposium on Information Theory. 2022, 2601\u20132606"},{"key":"3581_CR33","first-page":"1","volume-title":"Proceedings of 2021 IEEE Information Theory Workshop","author":"T Y Wu","year":"2021","unstructured":"Wu T Y, Han Y S, Li Z, Bai B, Zhang G, Zhang X, Wu X. Achievable lower bound on the optimal access bandwidth of (K + 2, K, 2)-MDS array code with degraded read friendly. In: Proceedings of 2021 IEEE Information Theory Workshop. 2021, 1\u20135"},{"key":"3581_CR34","first-page":"216","volume-title":"Proceedings of the 48th Annual ACM Symposium on Theory of Computing","author":"V Guruswami","year":"2016","unstructured":"Guruswami V, Wootters M. Repairing reed-Solomon codes. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing. 2016, 216\u2013226"},{"key":"3581_CR35","first-page":"216","volume-title":"Proceedings of the 58th Annual Symposium on Foundations of Computer Science","author":"I Tamo","year":"2017","unstructured":"Tamo I, Ye M, Barg A. Optimal repair of Reed-Solomon codes: achieving the cut-set bound. In: Proceedings of the 58th Annual Symposium on Foundations of Computer Science. 2017, 216\u2013227"},{"issue":"8","key":"3581_CR36","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 of Reed-Solomon codes. IEEE Transactions on Information Theory, 2022, 68(8): 5165\u20135177","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"3581_CR37","doi-asserted-by":"publisher","first-page":"2162","DOI":"10.1109\/TIT.2020.3036386","volume":"67","author":"J Li","year":"2021","unstructured":"Li J, Liu Y, Tang X. A systematic construction of MDS codes with small sub-packetization level and near-optimal repair bandwidth. IEEE Transactions on Information Theory, 2021, 67(4): 2162\u20132180","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"3581_CR38","doi-asserted-by":"publisher","first-page":"6506","DOI":"10.1109\/TIT.2018.2810095","volume":"64","author":"A S Rawat","year":"2018","unstructured":"Rawat A S, Tamo I, Guruswami V, Efremenko K. MDS code constructions with small sub-packetization and near-optimal repair bandwidth. IEEE Transactions on Information Theory, 2018, 64(10): 6506\u20136525","journal-title":"IEEE Transactions on Information Theory"},{"key":"3581_CR39","first-page":"293","volume-title":"Proceedings of 2023 International Conference on Wireless Communications and Signal Processing","author":"L Li","year":"2023","unstructured":"Li L, Ying C, Yu X, Chen L, Dong Y, Luo Y. Constructing MDS array codes with small repair bandwidth under sub-packetization two. In: Proceedings of 2023 International Conference on Wireless Communications and Signal Processing. 2023, 293\u2013298"},{"key":"3581_CR40","first-page":"1","volume-title":"Proceedings of the IEEE INFOCOM 2023-IEEE Conference on Computer Communications","author":"K Tang","year":"2023","unstructured":"Tang K, Cheng K, Chan H H W, Li X, Lee P P C, Hu Y, Li J, Wu T Y. Balancing repair bandwidth and sub-packetization in erasure-coded storage via elastic transformation. In: Proceedings of the IEEE INFOCOM 2023-IEEE Conference on Computer Communications. 2023, 1\u201310"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-024-3581-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-024-3581-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-024-3581-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:37:28Z","timestamp":1764686248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-024-3581-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["3581"],"URL":"https:\/\/doi.org\/10.1007\/s11704-024-3581-7","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"8 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2005101"}}