{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:46Z","timestamp":1740122506042,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:00:00Z","timestamp":1721692800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:00:00Z","timestamp":1721692800000},"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":["62171279"],"award-info":[{"award-number":["62171279"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Funding of SJTU-Alibaba Joint Research Lab on Cooperative Intelligent Computing"},{"name":"National Key R&D Program of China under Grant","award":["2022YFA1005000"],"award-info":[{"award-number":["2022YFA1005000"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10623-024-01440-8","type":"journal-article","created":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T07:01:47Z","timestamp":1721718107000},"page":"3783-3798","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MDS array codes with efficient repair and small sub-packetization level"],"prefix":"10.1007","volume":"92","author":[{"given":"Lei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinchun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenhao","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanyuan","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,23]]},"reference":[{"key":"1440_CR1","doi-asserted-by":"crossref","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: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 1225\u20131229 (2011).","DOI":"10.1109\/ISIT.2011.6033730"},{"issue":"5","key":"1440_CR2","doi-asserted-by":"publisher","first-page":"2974","DOI":"10.1109\/TIT.2013.2237752","volume":"59","author":"VR 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 Trans. Inf. Theory 59(5), 2974\u20132987 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1440_CR3","doi-asserted-by":"crossref","unstructured":"Calder B., Wang J., Ogus A., Nilakantan N., Skjolsvold A., McKelvie S., Xu Y., Srivastav S., Wu J., Simitci H., et al.: Windows Azure Storage: a highly available cloud storage service with strong consistency. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, pp. 143\u2013157 (2011).","DOI":"10.1145\/2043556.2043571"},{"issue":"9","key":"1440_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., Ramchandran K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539\u20134551 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1440_CR5","doi-asserted-by":"crossref","unstructured":"Ghemawat S., Gobioff H., Leung S.-T.: The google file system. In: Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, pp. 29\u201343 (2003).","DOI":"10.1145\/1165389.945450"},{"key":"1440_CR6","doi-asserted-by":"crossref","unstructured":"Hou H., Han Y.S., Bai B., Zhang G.: Towards efficient repair and coding of binary MDS array codes with small sub-packetization. In: 2022 IEEE International Symposium on Information Theory, pp. 3132\u20133137 (2022).","DOI":"10.1109\/ISIT50566.2022.9834869"},{"issue":"11","key":"1440_CR7","doi-asserted-by":"publisher","first-page":"7095","DOI":"10.1109\/TIT.2019.2923992","volume":"65","author":"H Hou","year":"2019","unstructured":"Hou H., Han Y.S., Lee P.P., Hu Y., Li H.: A new design of binary MDS array codes with asymptotically weak-optimal repair. IEEE Trans. Inf. Theory 65(11), 7095\u20137113 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1440_CR8","doi-asserted-by":"crossref","unstructured":"Li L., Ying C., Chen L., Dong Y., Luo Y.: New constructions of binary MDS array codes with optimal repair bandwidth. In: 2023 IEEE International Symposium on Information Theory, pp. 2045\u20132050 (2023).","DOI":"10.1109\/ISIT54713.2023.10206994"},{"key":"1440_CR9","doi-asserted-by":"crossref","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: 2023 15th International Conference on Wireless Communications and Signal Processing (2022).","DOI":"10.1109\/WCSP58612.2023.10405147"},{"issue":"9","key":"1440_CR10","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 Trans. Inf. Theory 64(9), 6257\u20136267 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1440_CR11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3248288","author":"Y Liu","year":"2023","unstructured":"Liu Y., Li J., Tang X.: A generic transformation to enable optimal repair\/access MDS array codes with multiple repair degrees. IEEE Trans. Inf. Theory (2023). https:\/\/doi.org\/10.1109\/TIT.2023.3248288.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1440_CR12","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"},{"key":"1440_CR13","doi-asserted-by":"crossref","unstructured":"Rawat A.S., Koyluoglu O.O., Vishwanath S.: Progress on high-rate MSR codes: enabling arbitrary number of helper nodes. In: 2016 Information Theory and Applications Workshop, pp. 1\u20136 (2016).","DOI":"10.1109\/ITA.2016.7888191"},{"issue":"10","key":"1440_CR14","doi-asserted-by":"publisher","first-page":"6506","DOI":"10.1109\/TIT.2018.2810095","volume":"64","author":"AS 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 Trans. Inf. Theory 64(10), 6506\u20136525 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1440_CR15","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. SIAM J. Appl. Math. 8(2), 300\u2013304 (1960).","journal-title":"SIAM J. Appl. Math."},{"key":"1440_CR16","volume-title":"Coding and Information Theory","author":"S Roman","year":"1992","unstructured":"Roman S.: Coding and Information Theory, vol. 134. Springer Science & Business Media, New York (1992)."},{"key":"1440_CR17","doi-asserted-by":"crossref","unstructured":"Sasidharan B., Agarwal G.K., Kumar P.V.: A high-rate MSR code with polynomial sub-packetization level. In: 2015 IEEE International Symposium on Information Theory, pp. 2051\u20132055 (2015).","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"1440_CR18","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 $$d<(n- 1)$$. In: 2017 IEEE International Symposium on Information Theory, pp. 2048\u20132052 (2017).","DOI":"10.1109\/ISIT.2017.8006889"},{"key":"1440_CR19","doi-asserted-by":"crossref","unstructured":"Shan Y., Chen K., Gong T., Zhou L., Zhou T., Wu Y.: Geometric partitioning: explore the boundary of optimal erasure code repair. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, pp. 457\u2013471 (2021).","DOI":"10.1145\/3477132.3483558"},{"key":"1440_CR20","doi-asserted-by":"crossref","unstructured":"Shvachko K., Kuang H., Radia S., Chansler R.: The Hadoop Distributed File System. In: 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies, pp. 1\u201310 (2010).","DOI":"10.1109\/MSST.2010.5496972"},{"key":"1440_CR21","doi-asserted-by":"crossref","unstructured":"Suh C., Ramchandran K.: Exact-repair MDS codes for distributed storage using interference alignment. In: 2010 IEEE International Symposium on Information Theory, pp. 161\u2013165 (2010).","DOI":"10.1109\/ISIT.2010.5513263"},{"issue":"3","key":"1440_CR22","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TIT.2012.2227110","volume":"59","author":"I Tamo","year":"2012","unstructured":"Tamo I., Wang Z., Bruck J.: Zigzag codes: MDS array codes with optimal rebuilding. IEEE Trans. Inf. Theory 59(3), 1597\u20131616 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1440_CR23","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 Trans. Inf. Theory 60(4), 2028\u20132037 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1440_CR24","unstructured":"Vajha M., Ramkumar V., Puranik B., Kini G., Lobo E., Sasidharan B., Kumar P.V., Barg A., Ye M., Narayanamurthy S., et al.: Clay codes: moulding MDS codes to yield an MSR code. In: 16th USENIX Conference on File and Storage Technologies, pp. 139\u2013154 (2018)."},{"key":"1440_CR25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3250458","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 Trans. Inf. Theory (2023). https:\/\/doi.org\/10.1109\/TIT.2023.3250458.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1440_CR26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3238759","author":"N Wang","year":"2023","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 (2023). https:\/\/doi.org\/10.1109\/TIT.2023.3238759.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1440_CR27","doi-asserted-by":"crossref","unstructured":"Wu Y., Dimakis A.G.: Reducing repair traffic for erasure coding-based storage via interference alignment. In: 2009 IEEE International Symposium on Information Theory, pp. 2276\u20132280 (2009). IEEE.","DOI":"10.1109\/ISIT.2009.5205898"},{"key":"1440_CR28","doi-asserted-by":"crossref","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: 2021 IEEE Information Theory Workshop, pp. 1\u20135 (2021).","DOI":"10.1109\/ITW48936.2021.9611476"},{"issue":"2","key":"1440_CR29","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 J. Sel. Areas Commun. 28(2), 277\u2013288 (2010).","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"1440_CR30","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":"1440_CR31","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 Trans. Inf. Theory 63(10), 6307\u20136317 (2017).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01440-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01440-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01440-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T18:04:40Z","timestamp":1727633080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01440-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,23]]},"references-count":31,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1440"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01440-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,7,23]]},"assertion":[{"value":"16 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2024","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 conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"All authors agreed with the content.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors agreed with the publication.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}