{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T03:58:23Z","timestamp":1725422303399},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523541","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"1246-1250","source":"Crossref","is-referenced-by-count":4,"title":["Finite-length analysis of turbo decoding on the binary erasure channel"],"prefix":"10.1109","author":[{"given":"E.","family":"Rosnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Ytrehus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1203996"},{"key":"2","first-page":"75","article-title":"Graph-covers and iterative decoding of finite length codes","author":"koetter","year":"2003","journal-title":"Proc 2nd Int Symp Turbo Codes &amp Related Topics"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.840632"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"7","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc ISCTA"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.556680"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2003.08.018"},{"key":"4","first-page":"389","article-title":"Trellis termination for turbo encoders","author":"guinand","year":"1994","journal-title":"Proc 17th Biennial Symp Commun"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523406"},{"key":"8","first-page":"306","article-title":"Computing the minimum distance of turbo-codes using iterative decoding techniques","author":"crozier","year":"2004","journal-title":"Proc 22th Biennial Symp Commun"},{"journal-title":"Proc IEEE Int Symp on Inform Theory (ISIT)","article-title":"Turbo stopping sets: The uniform interleaver and efficient enumeration","year":"2005","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824918"}],"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\/01523541.pdf?arnumber=1523541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T19:30:30Z","timestamp":1489606230000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523541\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523541","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}