{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:01:05Z","timestamp":1648594865712},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/tit.2012.2195711","type":"journal-article","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T14:03:16Z","timestamp":1339509796000},"page":"4796-4813","source":"Crossref","is-referenced-by-count":8,"title":["Analysis and Design of Tuned Turbo Codes"],"prefix":"10.1109","volume":"58","author":[{"given":"Christian","family":"Koller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Graell i Amat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorg","family":"Kliewer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Vatta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamil Sh","family":"Zigangirov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel J.","family":"Costello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1989.tb16434.x"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"4068","DOI":"10.1109\/TIT.2006.879973","article-title":"Joint permutor analysis and design for multiple turbo codes","volume":"52","author":"he","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853312"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658666"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090811"},{"key":"ref12","first-page":"1","article-title":"about the speaker","author":"kohler","year":"2008","journal-title":"2008 IET Seminar on V2 0 IAM Competence Requirements V2 0IAM"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2133610"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"ref15","article-title":"New low-complexity turbo-like codes","author":"massey","year":"2001","journal-title":"presented at the IEEE Inf Theory Workshop"},{"key":"ref16","article-title":"On the performance of low complexity multiple turbo codes","author":"he","year":"2002","journal-title":"presented at the 40th Annu Allerton Conf Commun Control Comput"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205355"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref19","author":"vontobel","year":"2005","journal-title":"Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831763"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805065"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708611"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/TIT.2008.2008114","article-title":"The minimum distance of turbo-like codes","volume":"55","author":"bazzi","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2002.1188420"},{"key":"ref5","author":"pfister","year":"2003","journal-title":"On the Capacity of Finite State Channels and the Analysis of Convolutional Accumulate-m Codes"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523316"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2008.4601028"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1995.525138"},{"key":"ref9","first-page":"80","article-title":"Serial and hybrid concatenated codes with applications","author":"divsalar","year":"1997","journal-title":"Proc Int Symp Turbo Codes Related Topics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref22","first-page":"201","article-title":"Coding theorems for `turbo-like' codes","author":"divsalar","year":"1998","journal-title":"Proc 36th Annual Allerton Conf Commun Control Comput"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/49.661111"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894109"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970920"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003833"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6216490\/06200859.pdf?arnumber=6200859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T18:33:28Z","timestamp":1561833208000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6200859\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":32,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2195711","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}