{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:38Z","timestamp":1740122678490,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61371125"],"award-info":[{"award-number":["61371125"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Young Talents Scientific Research Project of Education Department of Hubei Province","award":["Q20201902"],"award-info":[{"award-number":["Q20201902"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11277-022-09803-x","type":"journal-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T08:02:22Z","timestamp":1655020942000},"page":"1515-1534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Repairable Fountain Codes Scheme Based on Partial Duplication Technique"],"prefix":"10.1007","volume":"126","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3800-8254","authenticated-orcid":false,"given":"Anan","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2818-9357","authenticated-orcid":false,"given":"Benshun","family":"Yi","sequence":"additional","affiliation":[]},{"given":"Mian","family":"Xiang","sequence":"additional","affiliation":[]},{"given":"Laigan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,12]]},"reference":[{"key":"9803_CR1","doi-asserted-by":"crossref","unstructured":"Weatherspoon, H., & Kubiatowicz, J. D. (2002). Erasure coding vs. replication: A quantitative comparison. In Proceedings of the international workshop on peer-to-peer system (pp. 328\u2013337).","DOI":"10.1007\/3-540-45748-8_31"},{"issue":"9","key":"9803_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., & Ramchandran, K. (2010). Network coding for distributed storage systems. IEEE Transactions on Information Theory, 56(9), 4539\u20134551.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9803_CR3","unstructured":"Facebook Corp. (2013, September 16). A focus on efficiency. Retrieved June 2 2021, from http:\/\/newsroom.fb.com\/news\/2013\/09\/focusing-on-efficiency\/"},{"issue":"11","key":"9803_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. (2012). On the locality of codeword symbols. IEEE Transactions on Information Theory, 58(11), 6925\u20136934.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9803_CR5","doi-asserted-by":"crossref","unstructured":"Papailiopoulos, D. S., & Dimakis, A. G. (2012). Locally repairable codes. In Proceedings of the IEEE international symposium on information theory proceeding (ISIT) (pp. 2771\u20132775).","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"9803_CR6","unstructured":"Huang, C., Simitci, H., Xu, Y. K., Ogus, A., Calder, B., Gopalan, P., Li, J., & Yekhanim, S. (2012). Erasure coding in windows azure storage. In Proceedings of the USENIX conferences annual technical conference (pp. 1\u201312)."},{"key":"9803_CR7","doi-asserted-by":"crossref","unstructured":"Luby, M. (2002). LT Codes. In Proceedings of the 43rd Annual IEEE symposium on foundations computer science (pp. 271\u2013280).","DOI":"10.1109\/SFCS.2002.1181950"},{"issue":"6","key":"9803_CR8","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A Shokrollahi","year":"2006","unstructured":"Shokrollahi, A. (2006). Raptor codes. IEEE Transactions on Information Theory, 52(6), 2551\u20132567.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"9803_CR9","first-page":"1062","volume":"152","author":"DJC MacKay","year":"2005","unstructured":"MacKay, D. J. C. (2005). Fountain Codes. IEE Proceeding, Part I, Communications, 152(6), 1062\u20131068.","journal-title":"IEE Proceeding, Part I, Communications"},{"key":"9803_CR10","doi-asserted-by":"crossref","unstructured":"Cao, N., Wang, Q., Ren, K., & Lou, W.J. (2010). Distributed storage coding for flexible and efficient data dissemination and retrieval in wireless sensor networks. In Proceedings of the IEEE international conference on communications (ICC).","DOI":"10.1109\/ICC.2010.5501767"},{"key":"9803_CR11","unstructured":"Lu, H.F., Foh, C. H., Wen, Y.G., & Cai, J.F. (2012). Optimizing content retrieval delay for LT-based distributed cloud storage systems. In Proceedings of the IEEE global communications conference (GLOBECOM)."},{"key":"9803_CR12","doi-asserted-by":"crossref","unstructured":"Ye, X. C., Chen, W. T., & Tang, F. L. (2015). LT codes based distributed coding for efficient distributed storage in wireless sensor networks. In Proceedings of the IFIP networking conference.","DOI":"10.1109\/IFIPNetworking.2015.7145291"},{"key":"9803_CR13","doi-asserted-by":"crossref","unstructured":"Janet, J., Balakrishnan, S., & Somasekhara, K. (2016). Fountain code based cloud storage mechanism for optimal file retrieval delay. In Proceedings of thw international conference on information communication and embedded systems (ICICES).","DOI":"10.1109\/ICICES.2016.7518901"},{"issue":"5","key":"9803_CR14","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1109\/JSAC.2014.140522","volume":"32","author":"M Asteris","year":"2014","unstructured":"Asteris, M., & Dimakis, A. G. (2014). Repairable fountain codes. IEEE Journal on Selected Areas in Communications, 32(5), 1037\u20131047.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"9803_CR15","unstructured":"Gummadi, R. (2011). Coding and scheduling in networks for erasures and broadcast. Ph.D. dissertation, University of Illinois at Urbana Champaign."},{"key":"9803_CR16","doi-asserted-by":"crossref","unstructured":"Okpotse, T., & Yousefi, S. (2015). Locality-aware fountain codes for massive distributed storage systems. In Proceedings of the 2015 IEEE 14th Canadian workshop on information theory (CWIT) (pp. 18\u201321).","DOI":"10.1109\/CWIT.2015.7255143"},{"issue":"2","key":"9803_CR17","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1109\/TCOMM.2018.2879088","volume":"67","author":"T Okpotse","year":"2019","unstructured":"Okpotse, T., & Yousefi, S. (2019). Systematic fountain codes for massive storage using the truncated Poisson distribution. IEEE Transactions on Communications, 67(2), 943\u2013954.","journal-title":"IEEE Transactions on Communications"},{"issue":"4","key":"9803_CR18","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1109\/TNSE.2019.2932727","volume":"7","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Gu, S. S., Zhao, L., Zhang, N., Xiang, W., & Zhang, Q. Y. (2020). Repairable fountain coded storage systems for multi-tier mobile edge caching networks. IEEE Transactions on Network Science and Engineering, 7(4), 2310\u20132322.","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"9803_CR19","doi-asserted-by":"crossref","unstructured":"Baik, J., Suh, Y., Shin, M., Kim, S., & Kim, J. (2020). Locality-improved repairable fountain codes for distributed storage systems. In Proceedings of the IEEE international conference on communication (ICC).","DOI":"10.1109\/ICC40277.2020.9149295"},{"issue":"1","key":"9803_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/TIT.2020.3029427","volume":"67","author":"O Elishco","year":"2021","unstructured":"Elishco, O., & Barg, A. (2021). Capacity of dynamical storage systems. IEEE Transactions on Information Theory, 67(1), 329\u2013346.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-022-09803-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-022-09803-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-022-09803-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T10:50:32Z","timestamp":1663671032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-022-09803-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["9803"],"URL":"https:\/\/doi.org\/10.1007\/s11277-022-09803-x","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"7 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2022","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}