{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:59:40Z","timestamp":1778255980710,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T00:00:00Z","timestamp":1767398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T00:00:00Z","timestamp":1767398400000},"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-00859-7","type":"journal-article","created":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T02:04:49Z","timestamp":1767492289000},"page":"507-524","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["$$(1+\\epsilon )$$-optimal MDS codes: contacting any set of helper nodes smaller than $$n-1$$"],"prefix":"10.1007","volume":"18","author":[{"given":"Xing","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,3]]},"reference":[{"key":"859_CR1","unstructured":"MacWilliams F.J., Sloane N.J.: The theory of error-correcting codes. Elsevier (1977)"},{"issue":"9","key":"859_CR2","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":"859_CR3","unstructured":"Blaum M., Farell P.G., van Tilborg H.: Handbook of Coding Theory. Elsevier (1998)"},{"issue":"8","key":"859_CR4","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":"859_CR5","doi-asserted-by":"crossref","unstructured":"Wang, Z., Tamo, I., Bruck, J.: On codes for optimal rebuilding access. Proc. Annu. Allerton Conf. Commun., Control, Comput. 1374\u20131381 (2007)","DOI":"10.1109\/Allerton.2011.6120327"},{"issue":"3","key":"859_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":"859_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":"2","key":"859_CR8","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1109\/TIT.2014.2378255","volume":"61","author":"S Lin","year":"2015","unstructured":"Lin, S., Chung, W., Han, Y.S., Al-Naffouri, T.Y.: A unified form of exact-MSR codes via product-matrix frameworks. IEEE Trans. Inf. Theory 61(2), 873\u2013886 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"859_CR9","doi-asserted-by":"publisher","first-page":"1920","DOI":"10.1109\/TIT.2015.2408600","volume":"61","author":"J Li","year":"2015","unstructured":"Li, J., Tang, X., Parampalli, U.: A framework of constructions of minimal storage regenerating codes with the optimal access\/update property. IEEE Trans. Inf. Theory 61(4), 1920\u20131932 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"859_CR10","doi-asserted-by":"publisher","first-page":"5271","DOI":"10.1109\/TIT.2015.2461623","volume":"61","author":"X Tang","year":"2015","unstructured":"Tang, X., Yang, B., Li, J., Hollmann, H.D.L.: A new repair strategy for the Hadamard minimum storage regenerating codes for distributed storage systems. IEEE Trans. Inf. Theory 61(10), 5271\u20135279 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"859_CR11","unstructured":"Rashmi K.V., Nakkiran P., Wang J., Shah N.B., Ramchandran K.: Having your cake and eating it too: jointly optimal erasure codes for I\/O, storage, and network-bandwidth. In: Proc. USENIX FAST, pp. 81-94. (2015)"},{"issue":"6","key":"859_CR12","doi-asserted-by":"publisher","first-page":"3053","DOI":"10.1109\/TIT.2016.2553670","volume":"62","author":"H Hou","year":"2016","unstructured":"Hou, H., Shum, K.W., Chen, M., Li, H.: BASIC codes: low-complexity regenerating codes for distributed storage systems. IEEE Trans. Inf. Theory 62(6), 3053\u20133069 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"859_CR13","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"},{"issue":"9","key":"859_CR14","doi-asserted-by":"publisher","first-page":"4848","DOI":"10.1109\/TIT.2016.2590429","volume":"62","author":"J Li","year":"2016","unstructured":"Li, J., Tang, X.: Optimal exact repair strategy for the parity nodes of the (k+2, k) Zigzag code. IEEE Trans. Inf. Theory 62(9), 4848\u20134856 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"859_CR15","doi-asserted-by":"crossref","unstructured":"Nakkiran, P., Rashmi, K.V., Ramchandran, K.: Optimal systematic distributed storage codes with fast encoding. Proc. IEEE Int. Symp. Inf. Theory 430\u2013434 (2016)","DOI":"10.1109\/ISIT.2016.7541335"},{"key":"859_CR16","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:1607.07335","DOI":"10.1109\/ISIT.2017.8006889"},{"issue":"4","key":"859_CR17","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1109\/TIT.2017.2658660","volume":"63","author":"N Raviv","year":"2017","unstructured":"Raviv, N., Silberstein, N., Etzion, T.: Constructions of high-rate minimum storage regenerating codes over small fields. IEEE Trans. Inf. Theory 63(4), 2015\u20132038 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"859_CR18","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":"859_CR19","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"},{"issue":"10","key":"859_CR20","doi-asserted-by":"publisher","first-page":"6318","DOI":"10.1109\/TIT.2017.2690662","volume":"63","author":"S Goparaju","year":"2017","unstructured":"Goparaju, S., Fazeli, A., Vardy, A.: Minimum storage regenerating codes for all parameters. IEEE Trans. Inf. Theory 63(10), 6318\u20136328 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"859_CR21","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-1627. (2017)","DOI":"10.1109\/ISIT.2017.8006804"},{"key":"859_CR22","doi-asserted-by":"crossref","unstructured":"Li J., Tang X., Tian C.: An alternative generic transformation for optimal repair bandwidth and rebuilding access in MDS codes. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 1894-1898. (2018)","DOI":"10.1109\/ISIT.2018.8437320"},{"key":"859_CR23","unstructured":"Hou H., Lee P.P.C., Han Y.S.: Multi-layer transformed MDS codes with optimal repair access and low sub-packetization. (2019). arXiv:1907.08938v2"},{"issue":"2","key":"859_CR24","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1109\/TIT.2019.2941744","volume":"66","author":"Z Chen","year":"2020","unstructured":"Chen, Z., Barg, A.: Explicit constructions of MSR codes for clustered distributed storage: the rack-aware storage model. IEEE Trans. Inf. Theory 66(2), 886\u2013899 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"859_CR25","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1109\/TIT.2019.2939111","volume":"66","author":"H Hou","year":"2020","unstructured":"Hou, H., Lee, P.P.C.: Binary MDS array codes with optimal repair. IEEE Trans. Inf. Theory 66(3), 1405\u20131422 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"859_CR26","doi-asserted-by":"crossref","unstructured":"Duursma I., Wang H.: Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction. Applicable Algebra in Engineering, Communication and Computing. Available: https:\/\/doi.org\/10.1007\/s00200-021-00526-3","DOI":"10.1007\/s00200-021-00526-3"},{"key":"859_CR27","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1137\/20M1346742","volume":"5","author":"IM Duursma","year":"2021","unstructured":"Duursma, I.M., Li, X., Wang, H.P.: Multilinear algebra for distributed storage. SIAM J. Appl. Algebra Geom. 5, 552\u2013587 (2021)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"2","key":"859_CR28","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1109\/TCOMM.2021.3126751","volume":"70","author":"J Li","year":"2022","unstructured":"Li, J., Tang, X., Hollanti, C.: A generic transformation for optimal Node repair in MDS array codes over $$\\textbf{F} _2$$. IEEE Trans. Commun. 70(2), 727\u2013738 (2022)","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"859_CR29","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/TCOMM.2021.3129894","volume":"70","author":"Y Liu","year":"2022","unstructured":"Liu, Y., Li, J., Tang, X.: A generic transformation to generate MDS array codes with $$\\delta$$-optimal access property. IEEE Trans. Commun. 70(2), 759\u2013768 (2022)","journal-title":"IEEE Trans. Commun."},{"issue":"5","key":"859_CR30","doi-asserted-by":"publisher","first-page":"2874","DOI":"10.1109\/TIT.2023.3238345","volume":"69","author":"Z Zhang","year":"2023","unstructured":"Zhang, Z., Zhou, L.: A vertical-horizontal framework for building rack-aware regenerating codes. IEEE Trans. Inf. Theory 69(5), 2874\u20132885 (2023)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"859_CR31","doi-asserted-by":"publisher","first-page":"3775","DOI":"10.1109\/TIT.2023.3238759","volume":"69","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 69(6), 3775\u20133792 (2023)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"859_CR32","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.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)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"859_CR33","doi-asserted-by":"publisher","first-page":"5633","DOI":"10.1109\/TCOMM.2023.3293838","volume":"71","author":"J Li","year":"2023","unstructured":"Li, J., Liu, Y., Tang, X., Han, Y.S., Bai, B., Zhang, G.: MDS array codes with (near) optimal repair bandwidth for all admissible repair degrees. IEEE Trans. Commun. 71(10), 5633\u20135646 (2023)","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"859_CR34","doi-asserted-by":"publisher","first-page":"7790","DOI":"10.1109\/TIT.2024.3432822","volume":"70","author":"G Li","year":"2024","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. IEEE Trans. Inf. Theory 70(11), 7790\u20137806 (2024)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"859_CR35","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"},{"issue":"5","key":"859_CR36","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TIT.2014.2309000","volume":"60","author":"S Goparaju","year":"2014","unstructured":"Goparaju, S., Tamo, I., Calderbank, R.: An improved sub-packetization bound for minimum storage regenerating codes. IEEE Trans. Inf. Theory 60(5), 2770\u20132779 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"859_CR37","doi-asserted-by":"publisher","first-page":"8086","DOI":"10.1109\/TIT.2021.3112286","volume":"67","author":"O Alrabiah","year":"2021","unstructured":"Alrabiah, O., Guruswami, V.: An exponential lower bound on the sub-packetization of minimum storage regenerating codes. IEEE Trans. Inf. Theory 67(12), 8086\u20138093 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"859_CR38","doi-asserted-by":"publisher","first-page":"6452","DOI":"10.1109\/TIT.2022.3180034","volume":"68","author":"SB 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 Trans. Inf. Theory 68(10), 6452\u20136471 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"859_CR39","doi-asserted-by":"crossref","unstructured":"Rashmi K., Shah N.B., Gu D., Kuang H., Borthakur D., Ramchandran K.: \u201cA Hitchhiker\u2019s guide to fast and efficient data reconstruction in erasure-coded data centers. In: Proc. ACM SIGCOMM, pp. 331-342 (2014)","DOI":"10.1145\/2619239.2626325"},{"issue":"10","key":"859_CR40","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":"4","key":"859_CR41","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 Trans. Inf. Theory 67(4), 2162\u20132180 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"859_CR42","doi-asserted-by":"publisher","first-page":"6749","DOI":"10.1109\/TIT.2020.3023110","volume":"66","author":"V Guruswami","year":"2020","unstructured":"Guruswami, V., Lokam, S.V., Jayaraman, S.V.M.: $$\\varepsilon$$-MSR codes: contacting fewer code blocks for exact repair. IEEE Trans. Inf. Theory 66(11), 6749\u20136761 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"859_CR43","doi-asserted-by":"publisher","first-page":"6657","DOI":"10.1109\/TIT.2025.3582186","volume":"71","author":"V Ramkumar","year":"2025","unstructured":"Ramkumar, V., Raviv, N., Tamo, I.: $$\\varepsilon$$-MSR codes for any set of helper nodes. IEEE Trans. Inf. Theory 71(9), 6657\u20136667 (2025)","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-025-00859-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-025-00859-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00859-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:12:12Z","timestamp":1775038332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-025-00859-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,3]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["859"],"URL":"https:\/\/doi.org\/10.1007\/s12095-025-00859-7","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,3]]},"assertion":[{"value":"10 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2026","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval and Consent to Participate"}},{"value":"The author agrees to publish this article.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}]}}