{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:35:58Z","timestamp":1761708958260},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2014,5,23]],"date-time":"2014-05-23T00:00:00Z","timestamp":1400803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11432-014-5130-8","type":"journal-article","created":{"date-parts":[[2014,5,23]],"date-time":"2014-05-23T14:14:37Z","timestamp":1400854477000},"page":"1-9","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The design and analysis of unequal error protection fountain coding for multiple source networks over binary erasure channels"],"prefix":"10.1007","volume":"57","author":[{"given":"HanQin","family":"Shao","sequence":"first","affiliation":[]},{"given":"DaZhuan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"XiaoFei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,23]]},"reference":[{"key":"5130_CR1","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1049\/ip-com:20050237","volume":"152","author":"D J C MacKay","year":"2005","unstructured":"MacKay D J C. Fountain codes. IEE Proc Commun, 2005, 152: 1062\u20131068","journal-title":"IEE Proc Commun"},{"key":"5130_CR2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/285243.285258","volume":"28","author":"J W Byers","year":"1998","unstructured":"Byers J W, Luby M, Mitzenmacher M, et al. A digital fountain approach to reliable distribution of bulk data. ACM SIGCOMM Comput Commun Rev, 1998, 28: 56\u201367","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"5130_CR3","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/SFCS.2002.1181950","volume-title":"Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, 2002","author":"M Luby","year":"2002","unstructured":"Luby M. LT codes. In: Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, 2002. 2002. 271\u2013280"},{"key":"5130_CR4","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A Shokrollahi","year":"2006","unstructured":"Shokrollahi A. Raptor codes. IEEE Trans Inf Theory, 2006, 52: 2551\u20132567","journal-title":"IEEE Trans Inf Theory"},{"key":"5130_CR5","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li S Y R, et al. Network information flow. IEEE Trans Inf Theory, 2000, 46: 1204\u20131216","journal-title":"IEEE Trans Inf Theory"},{"key":"5130_CR6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S Y R Li","year":"2003","unstructured":"Li S Y R, Yeung R W, Cai N. Linear network coding. IEEE Trans Inf Theory, 2003, 49: 371\u2013381","journal-title":"IEEE Trans Inf Theory"},{"key":"5130_CR7","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/JPROC.2010.2093851","volume":"99","author":"S Y R Li","year":"2011","unstructured":"Li S Y R, Sun Q T, Shao Z. Linear network coding: theory and algorithms. Proc IEEE, 2011, 99: 372\u2013387","journal-title":"Proc IEEE"},{"key":"5130_CR8","doi-asserted-by":"crossref","first-page":"3217","DOI":"10.1109\/TCOMM.2011.091911.100189","volume":"59","author":"A Liau","year":"2011","unstructured":"Liau A, Yousefi S, Kim I M. Binary soliton-like rateless coding for the Y-network. IEEE Trans Commun, 2011, 59: 3217\u20133222","journal-title":"IEEE Trans Commun"},{"key":"5130_CR9","first-page":"987","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Seattle","author":"S Puducheri","year":"2006","unstructured":"Puducheri S, Kliewer J, Fuja T E. Distributed LT codes. In: Proceedings of IEEE International Symposium on Information Theory, Seattle, 2006. 987\u2013991"},{"key":"5130_CR10","doi-asserted-by":"crossref","first-page":"3740","DOI":"10.1109\/TIT.2007.904982","volume":"53","author":"S Puducheri","year":"2007","unstructured":"Puducheri S, Kliewer J, Fuja T E. The design and performance of distributed LT codes. IEEE Trans Inf Theory, 2007, 53: 3740\u20133754","journal-title":"IEEE Trans Inf Theory"},{"key":"5130_CR11","first-page":"261","volume-title":"Proceedings of IEEE Information Theory Workshop on Networking and Information Theory, Volos","author":"D Sejdinovic","year":"2009","unstructured":"Sejdinovic D, Piechocki R J, Doufexi A. AND-OR tree analysis of distributed LT codes. In: Proceedings of IEEE Information Theory Workshop on Networking and Information Theory, Volos, 2009. 261\u2013265"},{"key":"5130_CR12","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/LCOMM.2010.01.091541","volume":"14","author":"D Sejdinovic","year":"2010","unstructured":"Sejdinovic D, Piechocki R, Doufexi A, et al. Decentralised distributed fountain coding: asymptotic analysis and design. IEEE Commun Lett, 2010, 14: 42\u201344","journal-title":"IEEE Commun Lett"},{"key":"5130_CR13","doi-asserted-by":"crossref","first-page":"3586","DOI":"10.1109\/TIP.2012.2195668","volume":"21","author":"S S Arslan","year":"2012","unstructured":"Arslan S S, Cosman P C, Milstein L B. Generalized unequal error protection LT codes for progressive data transmission. IEEE Trans Image Process, 2012, 21: 3586\u20133597","journal-title":"IEEE Trans Image Process"},{"key":"5130_CR14","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1109\/TIT.2007.892814","volume":"53","author":"N Rahnavard","year":"2007","unstructured":"Rahnavard N, Vellambi B N, Fekri F. Rateless codes with unequal error protection property. IEEE Trans Inf Theory, 2007, 53: 1521\u20131532","journal-title":"IEEE Trans Inf Theory"},{"key":"5130_CR15","first-page":"523","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Seattle","author":"N Rahnavard","year":"2006","unstructured":"Rahnavard N, Fekri F. Generalization of rateless codes for unequal error protection and recovery time: asymptotic analysis. In: Proceedings of IEEE International Symposium on Information Theory, Seattle, 2006. 523\u2013527"},{"key":"5130_CR16","doi-asserted-by":"crossref","first-page":"2510","DOI":"10.1109\/TCOMM.2009.09.070616","volume":"57","author":"D Sejdinovic","year":"2009","unstructured":"Sejdinovic D, Vukobratovic D, Doufexi A, et al. Expanding window fountain codes for unequal error protection. IEEE Trans Commun, 2009, 57: 2510\u20132516","journal-title":"IEEE Trans Commun"},{"key":"5130_CR17","first-page":"2453","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Cambridge","author":"A Talari","year":"2010","unstructured":"Talari A, Rahnavard N. Distributed rateless codes with UEP property. In: Proceedings of IEEE International Symposium on Information Theory, Cambridge, 2010. 2453\u20132457"},{"key":"5130_CR18","doi-asserted-by":"crossref","first-page":"2084","DOI":"10.1109\/TCOMM.2012.051512.110109","volume":"60","author":"A Talari","year":"2012","unstructured":"Talari A, Rahnavard N. Distributed unequal error protection rateless codes over erasure channels: a two-source scenario. IEEE Trans Commun, 2012, 60: 2084\u20132090","journal-title":"IEEE Trans Commun"},{"key":"5130_CR19","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1109\/LCOMM.2013.040913.130187","volume":"17","author":"H Q Shao","year":"2013","unstructured":"Shao H Q, Xu D Z, Zhang X F. Asymptotic analysis and optimization for generalized distributed fountain codes. IEEE Commun Lett, 2013, 17: 988\u2013991","journal-title":"IEEE Commun Lett"},{"key":"5130_CR20","first-page":"364","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco","author":"M G Luby","year":"1998","unstructured":"Luby M G, Mitzenmacher M, Shokrollahi M A. Analysis of random processes via and-or tree evaluation. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1998. 364\u2013373"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5130-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-014-5130-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5130-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:37:57Z","timestamp":1559389077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-014-5130-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,23]]},"references-count":20,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["5130"],"URL":"https:\/\/doi.org\/10.1007\/s11432-014-5130-8","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,23]]}}}