{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:25:01Z","timestamp":1694636701204},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"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,6]]},"DOI":"10.1109\/tit.2009.2018342","type":"journal-article","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T21:01:44Z","timestamp":1242766904000},"page":"2602-2617","source":"Crossref","is-referenced-by-count":13,"title":["Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel"],"prefix":"10.1109","volume":"55","author":[{"given":"Igal","family":"Sason","sequence":"first","affiliation":[]},{"given":"Gil","family":"Wiechman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523591"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/BF02995451","article-title":"code characteristic matching for iterative decoding of serially concatenated codes","volume":"56","author":"ten brink","year":"2001","journal-title":"Ann Telecommun"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref34","year":"0","journal-title":"Big- Notation"},{"key":"ref10","first-page":"1","article-title":"irregular repeat-accumulate codes","author":"jin","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes and Related Topics"},{"key":"ref11","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":"ref12","author":"khandekar","year":"2002","journal-title":"Graph-based codes and iterative decoding"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref15","first-page":"277","article-title":"low-density parity-check codes with fast decoding convergence speed","author":"ma","year":"2004","journal-title":"Proc Int Symp Information Theory (ISIT)"},{"key":"ref16","first-page":"1","article-title":"are turbo-like codes effective on nonstandard channels ?","volume":"51","author":"mceliece","year":"2001","journal-title":"IEEE Information Theory Soc Newsletter"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030457"},{"key":"ref18","author":"measson","year":"2006","journal-title":"Conservation Laws for Coding"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907507"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523591"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/26.780444"},{"key":"ref3","first-page":"1","article-title":"turbo-decoder implementation for the deep space network","author":"andrews","year":"2001","journal-title":"The Interplanetary Network Progress Report"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834845"},{"key":"ref29","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":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1182"},{"key":"ref9","article-title":"capacity-achieving codes for noisy channels with bounded graphical complexity and maximum-likelihood decoding","author":"hsu","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894109"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896873"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021305"},{"key":"ref23","author":"richardson","year":"0","journal-title":"Finite-Length Density Evolution and the Distribution of the Number of Iterations for the Binary Erasure Channel"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828101"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813560"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4957623\/04957644.pdf?arnumber=4957644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:03:15Z","timestamp":1633910595000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4957644\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":34,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2018342","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}