{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:24:56Z","timestamp":1743125096436,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207273"},{"type":"electronic","value":"9783642207280"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20728-0_9","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T13:45:24Z","timestamp":1304603124000},"page":"94-99","source":"Crossref","is-referenced-by-count":1,"title":["LT-Codes and Phase Transitions for Mutual Information"],"prefix":"10.1007","author":[{"given":"Amin","family":"Shokrollahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon limit error-correcting coding and decoding. In: Proceedings of ICC 1993, Geneva, Switzerland, pp. 1064\u20131070 (May 1993)","key":"9_CR1","DOI":"10.1109\/ICC.1993.397441"},{"doi-asserted-by":"crossref","unstructured":"Byers, J., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. In: proceedings of ACM SIGCOMM 1988 (1998)","key":"9_CR2","DOI":"10.1145\/285237.285258"},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1109\/TIT.2006.872855","volume":"52","author":"O. Etesami","year":"2006","unstructured":"Etesami, O., Shokrollahi, A.: Raptor codes on binary memoryless symmetric channels. IEEE Trans.\u00a0Inform. Theory\u00a052(5), 2033\u20132051 (2006)","journal-title":"IEEE Trans.\u00a0Inform. Theory"},{"key":"9_CR4","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Random Graphs","author":"V. Kolchin","year":"1999","unstructured":"Kolchin, V.: Random Graphs. Encyclopedia of Mathematics and its Applications, vol.\u00a053. Cambridge University Press, Cambridge (1999)"},{"doi-asserted-by":"crossref","unstructured":"Kumar, K., Pakzad, P., Salavati, A., Shokrollahi, A.: Phase transitions for mutual information. In: 2010 6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), pp. 137\u2013141 (2010)","key":"9_CR5","DOI":"10.1109\/ISTC.2010.5613821"},{"unstructured":"Luby, M.: LT-codes. In: Proceedings of the 43rd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 271\u2013280 (2002)","key":"9_CR6"},{"doi-asserted-by":"crossref","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D.: Analysis of low density codes and improved designs using irregular graphs. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 249\u2013258 (1998)","key":"9_CR7","DOI":"10.1145\/276698.276756"},{"doi-asserted-by":"crossref","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D.: Improved low-density parity-check codes using irregular graphs and belief propagation. In: Proceedings 1998 IEEE International Symposium on Information Theory, p. 117 (1998)","key":"9_CR8","DOI":"10.1109\/ISIT.1998.708706"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/18.910575","volume":"47","author":"M. Luby","year":"2001","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D.: Efficient erasure correcting codes. IEEE Trans.\u00a0Inform. Theory\u00a047, 569\u2013584 (2001)","journal-title":"IEEE Trans.\u00a0Inform. Theory"},{"unstructured":"Luby, M.G.: Lt codes. In: Proceedings of 43rd IEEE Symposium Foundations of Computer Science, p. 10 (2002)","key":"9_CR10"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"D. MacKay","year":"1999","unstructured":"MacKay, D.: Good error-correcting codes based on very sparse matrices. IEEE Trans.\u00a0Inform. Theory\u00a045, 399\u2013431 (1999)","journal-title":"IEEE Trans.\u00a0Inform. Theory"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-60693-9_13","volume-title":"Cryptography and Coding","author":"D. MacKay","year":"1995","unstructured":"MacKay, D., Neal, R.: Good codes based on very sparse matrices. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol.\u00a01025, pp. 100\u2013111. Springer, Heidelberg (1995)"},{"issue":"12","key":"9_CR13","doi-asserted-by":"publisher","first-page":"5277","DOI":"10.1109\/TIT.2008.2006466","volume":"54","author":"C. Measson","year":"2008","unstructured":"Measson, C., Montanari, A., Urbanke, R.: Maxwell Construction: The Hidden Bridge Between Iterativew and Maximum a Posteriori Decoding. IEEE Transansactions on Information Theory\u00a054(12), 5277\u20135307 (2008)","journal-title":"IEEE Transansactions on Information Theory"},{"issue":"9","key":"9_CR14","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1109\/TIT.2005.853320","volume":"51","author":"A. Montanari","year":"2005","unstructured":"Montanari, A.: Tight bounds for ldpc and ldgm codes under map decoding. IEEE Transactions on Information Theory\u00a051(9), 3221\u20133246 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"unstructured":"Pakzad, P., Shokrollahi, A.: EXIT functions for LT and raptor codes, and asymptotic ranks of random matrices. In: Proc. of the IEEE International Symposium on Information Theory (ISIT), 2007, pp. 411\u2013415 (June 2007)","key":"9_CR15"},{"key":"9_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"T. Richardson","year":"2008","unstructured":"Richardson, T., Urbanke, R.: Modern Coding Theory. Cambridge University Press, Cambridge (2008)"},{"issue":"6","key":"9_CR17","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A. Shokrollahi","year":"2006","unstructured":"Shokrollahi, A.: Raptor codes. IEEE Trans.\u00a0Inform. Theory\u00a052(6), 2551\u20132567 (2006)","journal-title":"IEEE Trans.\u00a0Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20728-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T11:30:26Z","timestamp":1741174226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20728-0_9"}},"subtitle":["(Invited Talk)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207273","9783642207280"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20728-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}