{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:51:22Z","timestamp":1773377482810,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849536","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1347-1351","source":"Crossref","is-referenced-by-count":1,"title":["Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo Codes"],"prefix":"10.1109","author":[{"given":"Tarik","family":"Benaddi","sequence":"first","affiliation":[{"name":"Lab-STICC, DEOS, IMT Atlantique"}]},{"given":"Arti D.","family":"Yardi","sequence":"additional","affiliation":[{"name":"IIIT-Bangalore"}]},{"given":"Charly","family":"Poulliat","sequence":"additional","affiliation":[{"name":"IRIT\/INPT-ENSEEIHT"}]},{"given":"Iryna","family":"Andriyanova","sequence":"additional","affiliation":[{"name":"ETIS\/ENSEA,UCP, CNRS"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"Bit-interleaved coded modulation","volume":"5","author":"f\u00e0bregas","year":"2008","journal-title":"Foundations and Trends"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523540"},{"key":"ref13","author":"abramowitz","year":"1970","journal-title":"Handbook of Mathematical Functions"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2453267"},{"key":"ref15","author":"srinivasan","year":"2008","journal-title":"IEEE 802 16m Evaluation Methodology Document"},{"key":"ref4","first-page":"496","article-title":"On the thresholds of generalized LDPC convolutional codes based on protographs","author":"yardi","year":"2018","journal-title":"Proc of IEEE ISIT"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030457"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2014.6955090"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254239"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2016.7593145"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006466"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735965"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849536.pdf?arnumber=8849536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:00Z","timestamp":1773347640000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849536\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849536","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}