{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T05:59:33Z","timestamp":1721973573476},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1109\/lcomm.2006.1638621","type":"journal-article","created":{"date-parts":[[2006,6,8]],"date-time":"2006-06-08T20:14:12Z","timestamp":1149797652000},"page":"477-479","source":"Crossref","is-referenced-by-count":5,"title":["Efficient distance measurement method for turbo codes that use structured interleavers"],"prefix":"10.1109","volume":"10","author":[{"given":"Y.","family":"Ould-Cheikh-Mouhamedou","sequence":"first","affiliation":[]},{"given":"S.","family":"Crozier","sequence":"additional","affiliation":[]},{"given":"P.","family":"Kabal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2004.1377934"},{"key":"ref11","article-title":"Construction and performance of new tail-biting turbo codes","author":"crozier","year":"0","journal-title":"Proc of the 6th Int Workshop on Digital Signal Processing Techniques for Space Applications (DSP?98)"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BF02998577","article-title":"Multiple parallel concatenation of circular recursive convolutional (CRSC) codes","volume":"54","author":"berrou","year":"1999","journal-title":"Annals Telecommun"},{"key":"ref13","year":"2003","journal-title":"Interaction Channel for Satellite Distribution Systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312507"},{"key":"ref15","year":"2000","journal-title":"3 generation partnership project (3GPP) technical specification group Universal mobile telecommunications system (UMTS) multiplexing and channel coding (FDD) TS 25 212 v3 4 0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312511"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023277"},{"key":"ref6","first-page":"36","article-title":"Comparison of distance measurement methods for turbo codes","author":"ould-cheikh-mouhamedou","year":"0","journal-title":"Canadian Workshop on Information Theory (CWIT 05)"},{"key":"ref5","first-page":"306","article-title":"Computing the minimum distance of turbo-codes using iterative decoding techniques","author":"crozier","year":"0","journal-title":"Proc 22nd Biennial Symposium Commun 2004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.840632"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/49.924864"},{"key":"ref2","first-page":"169","article-title":"Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers","author":"crozier","year":"0","journal-title":"Proc 3 Int Symp Turbo Codes 2003"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICTEL.2003.1191190"}],"container-title":["IEEE Communications Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4234\/34359\/01638621.pdf?arnumber=1638621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:29:25Z","timestamp":1638217765000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1638621\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,6]]}},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2006.1638621","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}