{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T10:55:53Z","timestamp":1772016953198,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"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":[[2010,3]]},"DOI":"10.1109\/tit.2009.2039084","type":"journal-article","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T21:09:58Z","timestamp":1268428198000},"page":"992-1006","source":"Crossref","is-referenced-by-count":24,"title":["Capacity-Achieving Codes With Bounded Graphical Complexity and Maximum Likelihood Decoding"],"prefix":"10.1109","volume":"56","author":[{"given":"Chun-Hao","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Achilleas","family":"Anastasopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"key":"ref38","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198596783.001.0001","author":"pretzel","year":"1992","journal-title":"Error-Correcting Codes and Finite Fields"},{"key":"ref33","article-title":"Capacity-achieving codes with bounded graphical complexity on noisy channels","author":"hsu","year":"2005","journal-title":"Proc Allerton Conf Commun Control Comp"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887060"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883541"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523473"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828064"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883619"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.10.2519"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523485"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813560"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910580"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847727"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4234.905935","article-title":"On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit","volume":"5","author":"chung","year":"2001","journal-title":"IEEE Commun Lett"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836667"},{"key":"ref14","first-page":"201","article-title":"Coding theorems for ?turbo-like? codes","author":"divsalar","year":"1998","journal-title":"Proc Allerton Conf Commun Control Comp"},{"key":"ref15","author":"divsalar","year":"1999","journal-title":"A simple tight bound on error probability of block codes with application to turbo codes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.959254"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894109"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365380"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824918"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523316"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0165-3_9"},{"key":"ref27","article-title":"Raptor codes for hybrid ARQ","author":"soljanin","year":"2006","journal-title":"Proc Allerton Conf Commun Control Comp"},{"key":"ref3","first-page":"65","article-title":"new sequences of linear time erasure codes approaching channel capacity","author":"shokrollahi","year":"1999","journal-title":"Proc Int Symp Inf Theory Appl"},{"key":"ref6","first-page":"1","article-title":"Irregular repeat-accumulate codes","author":"jin","year":"2000","journal-title":"Proc Int Symp Turbo Codes and Related Topics"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860415"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828101"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258573"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"ref9","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.335935"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.782147"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/33\/8\/311"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928274"},{"key":"ref23","first-page":"1152","volume":"3","author":"divsalar","year":"2005","journal-title":"Protograph Based LDPC Codes with Minimum Distance Linearly Growing with Block Size"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805064"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896873"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850230"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.910589"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5429092\/05429143.pdf?arnumber=5429143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T02:44:25Z","timestamp":1711334665000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5429143\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":45,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2039084","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}