{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T10:55:15Z","timestamp":1772016915674,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1109\/tit.2009.2030457","type":"journal-article","created":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T17:29:54Z","timestamp":1256664594000},"page":"4793-4821","source":"Crossref","is-referenced-by-count":76,"title":["The Generalized Area Theorem and Some of its Consequences"],"prefix":"10.1109","volume":"55","author":[{"given":"Cyril","family":"Measson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas J.","family":"Richardson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00dcdiger","family":"Urbanke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023387"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840883"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1209-4"},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2539-1","author":"shiryaev","year":"1996","journal-title":"Probability"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.801408"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935911"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4613-0165-3_9","volume":"123","author":"shokrollahi","year":"2000","journal-title":"Codes Systems and Graphical Models"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887074"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.894645"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853297"},{"key":"ref40","article-title":"asymptotic analysis of turbo codes over the binary erasure channel","author":"masson","year":"2002","journal-title":"12th Joint Conf Commun Coding"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1049\/el:19990555"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/VETEC.1999.778363"},{"key":"ref19","first-page":"389","article-title":"designing iterative decoding schemes with the extrinsic information transfer chart","volume":"54","author":"ten brink","year":"2000","journal-title":"AEU Int J Electron Commun"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853320"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365262"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s100510170089"},{"key":"ref3","article-title":"an upper-bound on the ml thresholds of ldpc ensembles over the bec","author":"masson","year":"2003","journal-title":"Proc 41th Annu Allerton Conf Communication Control and Computing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920206"},{"key":"ref29","article-title":"improved bounds on the parity-check density and achievable rates of binary linear block codes with applications to ldpc codes","author":"wiechman","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006466"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523772"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844072"},{"key":"ref2","first-page":"1241","article-title":"maximum <emphasis emphasistype=\"italic\">a posteriori<\/emphasis> decoding and turbo codes for general memoryless channels","author":"masson","year":"2005","journal-title":"Proc IEEE Int Symp on Information Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523430"},{"key":"ref1","article-title":"life above threshold: from list decoding to area theorem and mse","author":"masson","year":"2004","journal-title":"Proc IEEE Information Theory Workshop"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref45","author":"guo","year":"2004","journal-title":"Gaussian channels Information estimation and multiuser detection"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref42","author":"forney","year":"2005","journal-title":"Lecture notes"},{"key":"ref24","article-title":"information processing and combining in channel coding","author":"huettinger","year":"2003","journal-title":"Proc 2nd Int Symp Turbo Codes &amp Related Topics"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228281"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840883"},{"key":"ref44","author":"zemanian","year":"1965","journal-title":"Distribution Theory and Transform Analysis"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365386"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/18.485714"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844077"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5290270\/05290273.pdf?arnumber=5290273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:29Z","timestamp":1633909949000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5290273\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":45,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2030457","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}