{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:37:16Z","timestamp":1725489436310},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523542","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T11:51:59Z","timestamp":1160567519000},"page":"1251-1255","source":"Crossref","is-referenced-by-count":6,"title":["Turbo stopping sets: the uniform interleaver and efficient enumeration"],"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":[{"doi-asserted-by":"publisher","key":"3","DOI":"10.1109\/TIT.2002.1003839"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/ISIT.2005.1523541"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/TCOMM.2004.840632"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/ICC.1993.397441"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/18.556606"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/18.333887"},{"key":"5","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":"4","first-page":"389","article-title":"Trellis termination for turbo encoders","author":"guinand","year":"1994","journal-title":"Proc 17th Biennial Symp Commun"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/49.924864"},{"year":"1977","author":"macwilliams","journal-title":"The Theory of Error-Correcting Codes","key":"8"},{"key":"11","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"}],"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\/01523542.pdf?arnumber=1523542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T18:16:21Z","timestamp":1489601781000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523542","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}