{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T10:55:14Z","timestamp":1772016914610,"version":"3.50.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"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":[[2008,12]]},"DOI":"10.1109\/tit.2008.2006466","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T21:30:00Z","timestamp":1228167000000},"page":"5277-5307","source":"Crossref","is-referenced-by-count":98,"title":["Maxwell Construction: The Hidden Bridge Between Iterative and Maximum<i>a Posteriori<\/i>Decoding"],"prefix":"10.1109","volume":"54","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":"R\u00dcdiger","family":"Urbanke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"flajolet","year":"1994","journal-title":"?The Average Case Analysis of Algorithms Saddle Point Asymptotics?"},{"key":"ref38","author":"sedgewick","year":"1996","journal-title":"An Introduction to Analysis of Algorithms"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1109\/TIT.2004.828064","article-title":"Asymptotic enumeration method for analyzing LDPC codes","volume":"50","author":"miller","year":"2004","journal-title":"IEEE Trans Inf Theory"},{"key":"ref31","first-page":"102","article-title":"weight distributions of ldpc code ensembles: combinatorics meets statistical physics","author":"di","year":"2004","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref37","author":"di","year":"2004","journal-title":"Asymptotic and Finite-Length Analysis of Low-Density Parity-Check Codes"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883541"},{"key":"ref35","first-page":"50","article-title":"weight distribution of iterative coding systems: how deviant can you be?","author":"di","year":"2001","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820012"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.370148"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853320"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833352"},{"key":"ref2","first-page":"63","article-title":"why practical' decoding algorithms are not as good as ideal' ones?","author":"montanari","year":"2001","journal-title":"Proc DIMACS Workshop on Codes and Complexity"},{"key":"ref1","article-title":"An upper-bound for the ML threshold of iterative coding systems over the BEC","author":"m\ufffdasson","year":"2003","journal-title":"Proc 41st Allerton Conf Communications Control and Computing"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s100510170089"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.62.1577"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.046120"},{"key":"ref23","article-title":"critical noise levels for ldpc decoding","volume":"66","author":"van mourik","year":"2002","journal-title":"Phys Rev E"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.485714"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.047205"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/35\/35\/301"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0165-3_9"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref40","author":"kittel","year":"2002","journal-title":"Thermal Physics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023387"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824918"},{"key":"ref14","article-title":"The generalized area theorem and some of its consequences","author":"m\ufffdasson","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/18.910576","article-title":"improved low-density parity-check codes using irregular graphs","volume":"47","author":"luby","year":"2001","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref4","article-title":"Life above threshold: From list decoding to area theorem and MSE","author":"m\ufffdasson","year":"2004","journal-title":"Proc IEEE Information Theory Workshop"},{"key":"ref3","article-title":"Maxwell's construction: The hidden bridge between maximum-likelihood and iterative decoding","author":"m\ufffdasson","year":"2004","journal-title":"Proc IEEE Int Symp Inform Theory"},{"key":"ref6","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref5","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1023\/A:1022886412117","article-title":"Alternative solutions to diluted p-spin models and XORSAT problems","volume":"111","author":"m\ufffdzard","year":"2003","journal-title":"J Stat Phys"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.782170"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref45","first-page":"266","article-title":"Further analytic properties of EXIT-like curves and applications","author":"m\ufffdasson","year":"2003","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708742"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1999.767979"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s100510170089"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"},{"key":"ref43","author":"m\ufffdasson","year":"2006","journal-title":"Conservation Laws for Coding"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4675712\/04675720.pdf?arnumber=4675720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T18:08:16Z","timestamp":1640282896000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4675720\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":54,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2006466","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}