{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:43:41Z","timestamp":1743054221176,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":9,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811065705"},{"type":"electronic","value":"9789811065712"}],"license":[{"start":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T00:00:00Z","timestamp":1528329600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-10-6571-2_6","type":"book-chapter","created":{"date-parts":[[2018,6,6]],"date-time":"2018-06-06T17:14:03Z","timestamp":1528305243000},"page":"45-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Intermediate Performance of Rateless Codes over Dying Erasure Channel"],"prefix":"10.1007","author":[{"given":"Shushi","family":"Gu","sequence":"first","affiliation":[]},{"given":"Jian","family":"Jiao","sequence":"additional","affiliation":[]},{"given":"Qinyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,7]]},"reference":[{"issue":"9","key":"6_CR1","doi-asserted-by":"crossref","first-page":"5711","DOI":"10.1109\/TIT.2012.2199078","volume":"58","author":"LR Varshney","year":"2012","unstructured":"Varshney, L.R., Mitter, S.K., Goyal, V.K.: An information-theoretic characterization of channels that die. IEEE Trans. Inf. Theory 58(9), 5711\u20135724 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"6_CR2","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TCOMM.2012.100812.110122","volume":"61","author":"M Zeng","year":"2013","unstructured":"Zeng, M., Zhang, R., Cui, S.: Outage capacity and optimal transmission for dying channels. IEEE Trans. Commun. 61(1), 357\u2013367 (2013)","journal-title":"IEEE Trans. Commun."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Luby, M.: LT codes. In: Proceeding of IEEE Symposium on the Foundations of Computer Science (STOC), Vancouver, BC, Canada, pp. 271\u2013280 (2002)","DOI":"10.1109\/SFCS.2002.1181950"},{"issue":"6","key":"6_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 52(6), 2551\u20132567 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Sanghavi S.: Intermediate performance of rateless codes. In: Proceeding 2007 IEEE Information Theory Workshop, Lake Tahoe, California, pp. 478\u2013482 (2007)","DOI":"10.1109\/ITW.2007.4313121"},{"issue":"5","key":"6_CR6","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1109\/TCOMM.2012.030712.110032","volume":"60","author":"A Talari","year":"2012","unstructured":"Talari, A., Rahnavard, N.: On the intermediate symbol recovery rate of rateless codes. IEEE Trans. Commun. 60(5), 1237\u20131242 (2012)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"6_CR7","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/TCOMM.2012.022712.110038","volume":"60","author":"M Zeng","year":"2012","unstructured":"Zeng, M., Calderbank, R., Cui, S.: On design of rateless codes over dying binary erasure channel. IEEE Trans. Commun. 60(4), 889\u2013894 (2012)","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"6_CR8","doi-asserted-by":"crossref","first-page":"4710","DOI":"10.1109\/TCOMM.2013.092813.120865","volume":"61","author":"N Thomos","year":"2013","unstructured":"Thomos, N., Pulikkoonattu, R., Frossard, P.: Growth codes: intermediate performance analysis and application to video. IEEE Trans. Commun. 61(11), 4710\u20134721 (2013)","journal-title":"IEEE Trans. Commun."},{"key":"6_CR9","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, A.: Analysis of random processes via and-or tree evaluation. In: Proceeding 1998 ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 364\u2013373 (1998)"}],"container-title":["Lecture Notes in Electrical Engineering","Communications, Signal Processing, and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-6571-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,21]],"date-time":"2018-07-21T04:36:03Z","timestamp":1532147763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-6571-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,7]]},"ISBN":["9789811065705","9789811065712"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-6571-2_6","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2018,6,7]]}}}