{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T12:04:25Z","timestamp":1777982665590,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"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":[[2025,3]]},"DOI":"10.1007\/s12095-024-00762-7","type":"journal-article","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T23:32:02Z","timestamp":1732836722000},"page":"377-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new repair-efficient piggybacking design for systematic nodes"],"prefix":"10.1007","volume":"17","author":[{"given":"Xing","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,29]]},"reference":[{"key":"762_CR1","doi-asserted-by":"crossref","unstructured":"Sathiamoorthy, M., Asteris, M., Papailiopoulos, D., Dimakis, A.G., Vadali, R., Chen, S., Borthakur, D.: Xoring elephants: novel erasure codes for big data. In: Proc. VLDB Endowment, pp. 325\u2013336 (2013)","DOI":"10.14778\/2535573.2488339"},{"key":"762_CR2","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: Proc. Usenix Hotstorage, pp. 8 (2013)"},{"issue":"9","key":"762_CR3","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":"762_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"},{"issue":"3","key":"762_CR5","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":"762_CR6","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":"762_CR7","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":"762_CR8","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":"762_CR9","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":"762_CR10","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"},{"key":"762_CR11","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. Inf. Theory, pp. 1623\u20131627 (2017)","DOI":"10.1109\/ISIT.2017.8006804"},{"issue":"6","key":"762_CR12","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":"762_CR13","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"},{"key":"762_CR14","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:2303.10467v1","DOI":"10.1109\/ISIT57864.2024.10619086"},{"issue":"4","key":"762_CR15","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":"762_CR16","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":"762_CR17","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":"762_CR18","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"},{"issue":"9","key":"762_CR19","first-page":"5802","volume":"63","author":"KV 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 Trans. Inf. Theory 63(9), 5802\u20135820 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"762_CR20","doi-asserted-by":"publisher","first-page":"3245","DOI":"10.1109\/TCOMM.2018.2805347","volume":"66","author":"S Yuan","year":"2018","unstructured":"Yuan, S., Huang, Q., Wang, Z.: A repair-efficient coding for distributed storage systems under piggybacking framework. IEEE Trans. Communications. 66(8), 3245\u20133254 (2018)","journal-title":"IEEE Trans. Communications."},{"key":"762_CR21","doi-asserted-by":"publisher","first-page":"2753","DOI":"10.1007\/s10623-019-00650-9","volume":"87","author":"C Shangguan","year":"2019","unstructured":"Shangguan, C., Ge, G.: A new piggybacking design for systematic mds storage codes. Des. Codes Crypt. 87, 2753\u20132770 (2019)","journal-title":"Des. Codes Crypt."},{"issue":"12","key":"762_CR22","doi-asserted-by":"publisher","first-page":"8193","DOI":"10.1109\/TCOMM.2019.2941933","volume":"67","author":"GY Li","year":"2019","unstructured":"Li, G.Y., Lin, X., Tang, X.: An efficient one-to-one piggybacking design for distributed storage systems. IEEE Trans. Communications. 67(12), 8193\u20138205 (2019)","journal-title":"IEEE Trans. Communications."},{"key":"762_CR23","doi-asserted-by":"crossref","unstructured":"Jiang, Z., Hou, H., Han, Y.S., Huang, Z., Bai, B., Zhang, G.: An efficient piggybacking design with lower repair bandwidth and lower sub-packetization. In: Proc. IEEE Int. Symp. Inf. Theory. pp. 2328\u20132333 (2021)","DOI":"10.1109\/ISIT45174.2021.9518037"},{"issue":"7","key":"762_CR24","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 Commun. Lett. 25(7), 2099\u20132103 (2021)","journal-title":"IEEE Commun. Lett."},{"key":"762_CR25","doi-asserted-by":"crossref","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: Proc. IEEE Int. Symp. Inf. Theory. pp. 2601\u20132606 (2022)","DOI":"10.1109\/ISIT50566.2022.9834881"},{"issue":"11","key":"762_CR26","doi-asserted-by":"publisher","first-page":"5779","DOI":"10.1109\/TIT.2015.2472524","volume":"61","author":"B Yang","year":"2015","unstructured":"Yang, B., Tang, X., Li, J.: A systematic piggybacking design for minimum storage regenerating codes. IEEE Trans. Inf. Theory 61(11), 5779\u20135786 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"762_CR27","unstructured":"Apache Hadoop Release 3.0.0-Alpha1(2017), accessed on Jun. 15 2017. [Online]. Available: https:\/\/github.com\/apache\/hadoop\/tree\/release-3.0.0-alpha1-RC0"},{"key":"762_CR28","doi-asserted-by":"crossref","unstructured":"Rashmi, K., Shah, N.B., Gu, D., Kuang, H., Borthakur, D., Ramchandran, K.: A Hitchhiker\u2019s guide to fast and efficient data reconstruction in erasure-coded data centers. In: Proc. ACM SIGCOMM, pp. 331\u2013342 (2014)","DOI":"10.1145\/2740070.2626325"},{"issue":"10","key":"762_CR29","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":"762_CR30","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"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00762-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00762-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00762-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T16:02:59Z","timestamp":1742572979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00762-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,29]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["762"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00762-7","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.24065268.v1","asserted-by":"object"}]},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,29]]},"assertion":[{"value":"20 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2024","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"}}]}}