{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T11:06:34Z","timestamp":1743851194192,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523540","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"1241-1245","source":"Crossref","is-referenced-by-count":13,"title":["Maximum a posteriori decoding and turbo codes for general memoryless channels"],"prefix":"10.1109","author":[{"given":"C.","family":"Measson","sequence":"first","affiliation":[]},{"given":"R.","family":"Urbanke","sequence":"additional","affiliation":[]},{"given":"A.","family":"Montanari","sequence":"additional","affiliation":[]},{"given":"T.","family":"Richardson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844072"},{"journal-title":"Modern Coding Theory","year":"2005","author":"richardson","key":"15"},{"key":"16","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/18.485714","article-title":"Iterative decoding of binary block and convolutional codes","volume":"42","author":"hagenauer","year":"1996","journal-title":"IEEE Trans on Information Theory"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228281"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866615"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023387"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"1","article-title":"An upper-bound for the ML threshold of iterative coding systems over the BEC","author":"me?asson","year":"2003","journal-title":"Proc of the Forty-first Allerton Conference on Communications Control and Computing"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"6","article-title":"Life above threshold: From list decoding to Area Theorem and MSE","author":"me?asson","year":"2004","journal-title":"Proc of the 2004 ITW San Antonio USA"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365262"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523540.pdf?arnumber=1523540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T16:43:21Z","timestamp":1555865001000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523540\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523540","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}