{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:47:40Z","timestamp":1774680460507,"version":"3.50.1"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"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,7]]},"DOI":"10.1109\/tit.2009.2021305","type":"journal-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T19:04:27Z","timestamp":1245179067000},"page":"2956-2990","source":"Crossref","is-referenced-by-count":28,"title":["On Universal Properties of Capacity-Approaching LDPC Code Ensembles"],"prefix":"10.1109","volume":"55","author":[{"given":"Igal","family":"Sason","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000009","volume":"3","author":"sason","year":"2006","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595097"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.335935"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896873"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.1638622"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1222728"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853320"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.818403"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref2","author":"amraoui","year":"0","journal-title":"LdpcOpt Software for Optimizing the Degree Distrbutions of LDPC Code Ensembles"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1182"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911266"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref21","first-page":"1","article-title":"on the complexity of reliable communication on the erasure channel","author":"khandekar","year":"2001","journal-title":"Proc IEEE Int Symp Information Theory (ISIT)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030457"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.224"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838090"},{"key":"ref56","year":"0","journal-title":"Big-O Notation"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2001.910571"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920216"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889606"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262130"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261868"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872855"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813560"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.782170"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.885042"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref15","author":"grant","year":"2008","journal-title":"CVX MATLAB Software for Disciplined Convex Programming"},{"key":"ref16","author":"gross","year":"1999","journal-title":"Graph Theory and its Applications"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887511"},{"key":"ref18","first-page":"1825","article-title":"capacity-achieving codes with bounded graphical complexity on noisy channels","author":"hsu","year":"2005","journal-title":"Proc 43rd Annu Allerton Conf Communications Control and Computing"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928274"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594964"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523591"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.801408"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.894645"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2007.895188"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.877956"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4613-0165-3_9","article-title":"capacity-achieving sequences","volume":"123","author":"shokrollahi","year":"2000","journal-title":"IMA Volume in Mathematics and its Applications"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903156"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018342"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889462"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"key":"ref43","article-title":"check-irregular ldpc codes for unequal error protection under iterative decoding","author":"sassatelli","year":"2006","journal-title":"Proc 4th Int Symp Turbo Codes and Related Topics"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5075865\/05075886.pdf?arnumber=5075886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:06Z","timestamp":1633909926000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5075886\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":56,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2021305","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,7]]}}}