{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:20:13Z","timestamp":1729653613676,"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.1523406","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T11:51:59Z","timestamp":1160567519000},"page":"602-606","source":"Crossref","is-referenced-by-count":10,"title":["On the construction of good families of rate-compatible punctured turbo codes"],"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":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866749"},{"key":"15","first-page":"169","article-title":"Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers","author":"crozier","year":"2003","journal-title":"Proc 2nd Int Symp Turbo Codes and Related Topics"},{"key":"16","first-page":"3","article-title":"New high-spread high-distance interleavers for turbocodes","author":"crozier","year":"2000","journal-title":"Proc 20th Biennial Symp Commun"},{"journal-title":"3rd Generation Partnership Project","year":"1999","key":"13"},{"key":"14","first-page":"389","article-title":"Trellis termination for turbo encoders","author":"guinand","year":"0","journal-title":"Pmc 17th Biennial Symp Commun"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826237"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.829561"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/49.924864"},{"key":"2","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1109\/18.556666","article-title":"A distance spectrum interpretation of turbo codes","volume":"42","author":"ferez","year":"1996","journal-title":"IEEE Transactions on Information Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/26.848555"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023277"},{"key":"6","first-page":"361","article-title":"The all-zero iterative decoding algorithm for turbo code minimum distance computation","volume":"1","author":"vila-casado","year":"2004","journal-title":"Proc IEEE Int Conf Commun"},{"key":"5","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"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.840632"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1049\/el:19950406"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/26.2763"}],"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\/01523406.pdf?arnumber=1523406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T06:08:26Z","timestamp":1497679706000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523406","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}