{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:58:01Z","timestamp":1752361081084,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T00:00:00Z","timestamp":1559606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T00:00:00Z","timestamp":1559606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11431003","61571310"],"award-info":[{"award-number":["11431003","61571310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10623-019-00650-9","type":"journal-article","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T09:32:13Z","timestamp":1559640733000},"page":"2753-2770","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A new piggybacking design for systematic MDS storage codes"],"prefix":"10.1007","volume":"87","author":[{"given":"Chong","family":"Shangguan","sequence":"first","affiliation":[]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,4]]},"reference":[{"key":"650_CR1","first-page":"337","volume":"1","author":"R Bhagwan","year":"2004","unstructured":"Bhagwan R., Tati K., Cheng Y., Savage S., Voelker G.M.: Total recall: system support for automated availability management. Nsdi 1, 337\u2013350 (2004).","journal-title":"Nsdi"},{"key":"650_CR2","unstructured":"Colossus: Successor to the Google File System. \n                    https:\/\/www.systutorials.com\/3202\/colossus-successor-to-google-file-system-gfs\/\n                    \n                  ."},{"issue":"9","key":"650_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":"11","key":"650_CR4","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"Gopalan P., Huang C., Simitci H., Yekhanin S.: On the locality of codeword symbols. IEEE Trans. Inf. Theory 58(11), 6925\u20136934 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"650_CR5","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":"10","key":"650_CR6","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":"650_CR7","unstructured":"HDFS-Raid. \n                    http:\/\/wiki.apache.org\/hadoop\/hdfs-raid\n                    \n                  ."},{"key":"650_CR8","unstructured":"Huang C., Simitci H., Xu Y., Ogus A., Calder B., Gopalan P., Li J., Yekhanin S.: Erasure coding in windows azure storage. In: Usenix Conference on Technical Conference, p. 2 (2012)."},{"issue":"11","key":"650_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/356989.357007","volume":"35","author":"J Kubiatowicz","year":"2002","unstructured":"Kubiatowicz J., Bindel D., Chen Y., Czerwinski S., Eaton P., Geels D., Gummadi R., Rhea S., Weatherspoon H., Wells C.: OceanStore: an architecture for global-scale persistent storage. ACM SIGPLAN Not. 35(11), 190\u2013201 (2002).","journal-title":"ACM SIGPLAN Not."},{"key":"650_CR10","doi-asserted-by":"crossref","unstructured":"Kumar S., i\u00a0Amat A.G., Andriyanova I., Br\u00e4nnstr\u00f6m F.: A family of erasure correcting codes with low repair bandwidth and low repair complexity. In: IEEE Global Communication Conference, pp. 1\u20136 (2015).","DOI":"10.1109\/GLOCOM.2015.7417790"},{"key":"650_CR11","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. Usenix Hotstorage (2013)"},{"key":"650_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1145\/2740070.2626325","volume":"44","author":"KV Rashmi","year":"2014","unstructured":"Rashmi K.V., Shah N.B., Gu D., Kuang D., Borthakur D., Ramchandran K.: A Hitchhiker\u2019s guide to fast and efficient data reconstruction in erasure-coded data centers. ACM SIFCOMM Comput. Commun. Rev. 44, 331\u2013342 (2014).","journal-title":"ACM SIFCOMM Comput. Commun. Rev."},{"issue":"9","key":"650_CR13","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"},{"key":"650_CR14","unstructured":"Rawat A.S., Koyluoglu O.O., Vishwanath S.: Progress on high-rate MSR codes: enabling arbitrary number of helper nodes. In: Information Theory and Applications Workshop (ITA), IEEE, pp. 1\u20136 (2016)."},{"key":"650_CR15","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. arXiv preprint arXiv:1607.07335 (2016)."},{"key":"650_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 $d<(n- 1)$. In: Proceedings of IEEE International Symposium on Information Theory, pp. 2048\u20132052 (2017)","DOI":"10.1109\/ISIT.2017.8006889"},{"key":"650_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"IT\u201310","author":"RC Singleton","year":"1964","unstructured":"Singleton R.C.: Maximum distance $q$-nary codes. IEEE Trans. Inf. Theory IT\u201310, 116\u2013118 (1964).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"650_CR18","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2013","unstructured":"Tamo I., Barg A.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory 60(8), 4661\u20134676 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"650_CR19","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TIT.2012.2227110","volume":"59","author":"I Tamo","year":"2015","unstructured":"Tamo I., Wang Z., Bruck J.: Zigzag codes: MDS array codes with optimal rebuilding. IEEE Trans. Inf. Theory 59(3), 1597\u20131616 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"650_CR20","doi-asserted-by":"crossref","unstructured":"Wang Z., Tamo I., Bruck J.: Long MDS codes for optimal repair bandwidth. In: Proceedings of IEEE International Symposium on Information Theory, pp. 1182\u20131186 (2012)","DOI":"10.1109\/ISIT.2012.6283041"},{"issue":"11","key":"650_CR21","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"},{"issue":"4","key":"650_CR22","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"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00650-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00650-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00650-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T23:19:18Z","timestamp":1591139958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00650-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,4]]},"references-count":22,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["650"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00650-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,6,4]]},"assertion":[{"value":"18 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}