{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:13:58Z","timestamp":1746072838892,"version":"3.40.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,26]],"date-time":"2013-04-26T00:00:00Z","timestamp":1366934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1186\/1687-1499-2013-115","type":"journal-article","created":{"date-parts":[[2013,4,26]],"date-time":"2013-04-26T00:14:44Z","timestamp":1366935284000},"source":"Crossref","is-referenced-by-count":1,"title":["A survey of three-dimensional turbo codes and recent performance enhancements"],"prefix":"10.1186","volume":"2013","author":[{"given":"Dhouha Kbaier Ben","family":"Ismail","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Douillard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvie","family":"Kerou\u00e9dan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,26]]},"reference":[{"key":"665_CR1","first-page":"1064","volume-title":"Proc. ICC'93","author":"C Berrou","year":"1993","unstructured":"Berrou C, Glavieux A, Thitimajshima P: Near Shannon limit error-correcting coding and decoding: turbo-codes. In Proc. ICC'93. Geneva; 1993:1064-1070."},{"key":"665_CR2","first-page":"156","volume-title":"Proc. IEEE Inform. Theory Workshop","author":"C Berrou","year":"2007","unstructured":"Berrou C, Graell-i-Amat A, Ould-Cheikh-Mouhamedou Y, Douillard C, Saouter Y: Adding a rate-1 third dimension to turbo codes. In Proc. IEEE Inform. Theory Workshop. Lake Tahoe; 2007:156-161."},{"issue":"9","key":"665_CR3","doi-asserted-by":"publisher","first-page":"2505","DOI":"10.1109\/TCOMM.2009.09.070521","volume":"57","author":"C Berrou","year":"2009","unstructured":"Berrou C, Graell-i-Amat A, Ould-Cheikh-Mouhamedou Y, Saouter Y: Improving the distance properties of turbo codes using a third component code: 3D turbo codes. IEEE Trans Commun 2009, 57(9):2505-2509.","journal-title":"IEEE Trans Commun"},{"key":"665_CR4","volume-title":"IEEE Int. Symp. Inf. Theory, Palais de Beaulieu","author":"J Boutros","year":"2002","unstructured":"Boutros J, Caire G, Viterbo E, Sawaya H, Vialle S: Turbo code at 0.03 dB from capacity limit. In IEEE Int. Symp. Inf. Theory, Palais de Beaulieu. Lausanne, Switzerland; 30 June to 5 July 2002."},{"key":"665_CR5","unstructured":"Third Generation Partnership Project 2 (3GPP2): Physical layer standard for cdma2000 spread spectrum systems, Release F, December 2012, 3GPP2 C.S0002-F, Version 1.0. http:\/\/www.3gpp2.org\/public_html\/specs\/C.S0002-F_v1.0_cdma2000_1x_PHY_20121210.pdf"},{"key":"665_CR6","volume-title":"ComNet'09: 1st Int. Conference on Communications and Networking","author":"D Kbaier Ben Ismail","year":"2009","unstructured":"Kbaier Ben Ismail D, Douillard C, Kerou\u00e9dan S: Improving 3-dimensional turbo codes using 3GPP2 interleavers. In ComNet'09: 1st Int. Conference on Communications and Networking. Hammamet; 2009."},{"key":"665_CR7","first-page":"146","volume-title":"6th Int. Symp. Turbo Codes and Related Topics, Brest","author":"D Kbaier Ben Ismail","year":"2010","unstructured":"Kbaier Ben Ismail D, Douillard C, Kerou\u00e9dan S: Reducing the convergence loss of 3-dimensional turbo codes. 6th Int. Symp. Turbo Codes and Related Topics, Brest 2010, 146-150."},{"issue":"7","key":"665_CR8","first-page":"257","volume":"65","author":"D Kbaier Ben Ismail","year":"2011","unstructured":"Kbaier Ben Ismail D, Douillard C, Kerou\u00e9dan S: Analysis of 3-dimensional turbo codes. Ann Telecommun 2011, 65(7):257-268.","journal-title":"Ann Telecommun"},{"issue":"21","key":"665_CR9","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1049\/el.2011.2258","volume":"47","author":"D Kbaier Ben Ismail","year":"2011","unstructured":"Kbaier Ben Ismail D, Douillard C, Kerou\u00e9dan S: Improving irregular turbo codes. Electron Lett 2011, 47(21):1184-1186. 10.1049\/el.2011.2258","journal-title":"Electron Lett"},{"issue":"13","key":"665_CR10","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1049\/el.2011.0990","volume":"47","author":"D Kbaier Ben Ismail","year":"2011","unstructured":"Kbaier Ben Ismail D, Douillard C, Kerou\u00e9dan S: Design of suitable permutations for irregular turbo codes. Electron Lett 2011, 47(13):748-749. 10.1049\/el.2011.0990","journal-title":"Electron Lett"},{"key":"665_CR11","first-page":"235","volume-title":"Code doping for triggering iterative decoding convergence in Proc IEEE Int","author":"S ten Brink","year":"2001","unstructured":"ten Brink S: Code doping for triggering iterative decoding convergence in Proc IEEE Int. Washington, DC, Jun: Symp. Inf. Theory; 2001:235."},{"issue":"8","key":"665_CR12","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1109\/TCOMM.2005.852832","volume":"53","author":"E Boutillon","year":"2005","unstructured":"Boutillon E, Gnaeding D: Maximum spread of D-dimensional multiple turbo codes. IEEE Trans Commun 2005, 53(8):1237-1242. 10.1109\/TCOMM.2005.852832","journal-title":"IEEE Trans Commun"},{"key":"665_CR13","first-page":"361","volume-title":"Proc. ICC'2004","author":"R Garello","year":"2004","unstructured":"Garello R, Casado A: The all-zero iterative decoding algorithm for turbo code minimum distance computation. In Proc. ICC'2004. Paris; 2004:361-364."},{"key":"665_CR14","first-page":"46","volume-title":"IEEE Inform. Theory Workshop (ITW)","author":"GI Amat","year":"2010","unstructured":"Amat GI, Rosnes E: Analysis of 3-dimensional turbo code ensembles. In IEEE Inform. Theory Workshop (ITW). Dublin; 30 August to 3 September 2010:46-50."},{"issue":"10","key":"665_CR15","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1109\/26.957394","volume":"49","author":"S Ten Brink","year":"2001","unstructured":"Ten Brink S: Convergence behaviour of iteratively decoded parallel concatenated codes. IEEE Trans Commun 2001, 49(10):1727-1737. 10.1109\/26.957394","journal-title":"IEEE Trans Commun"},{"issue":"3","key":"665_CR16","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1109\/TIT.1974.1055223","volume":"20","author":"D Costello Jr","year":"1974","unstructured":"Costello D Jr: Free distance bounds for convolutional codes. IEEE Trans. Inform. Theory 1974, 20(3):356-365. 10.1109\/TIT.1974.1055223","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"665_CR17","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/18.669123","volume":"44","author":"G Caire","year":"1998","unstructured":"Caire G, Taricco G, Biglieri E: Bit - interleaved coded modulation. IEEE Trans. Inform. Theory 1998, 44(3):927-946. 10.1109\/18.669123","journal-title":"IEEE Trans. Inform. Theory"},{"key":"665_CR18","volume-title":"Digital modulation schemes in Digital Communications","author":"JG Proakis","year":"2008","unstructured":"Proakis JG, Salehi M: Digital modulation schemes in Digital Communications. Volume 3. 5th edition. Colombus: McGraw-Hill; 2008.","edition":"5"},{"key":"665_CR19","volume-title":"7th International Workshop on DSP Tech. for Space Communications","author":"J Boutros","year":"2001","unstructured":"Boutros J: Asymptotic behavior study of irregular turbo codes. In 7th International Workshop on DSP Tech. for Space Communications. S\u00e9simbra; 2001."},{"key":"665_CR20","first-page":"201","volume-title":"Proc. 36th Allerton Conference on Communications, Control, and Computing","author":"D Divsalar","year":"1998","unstructured":"Divsalar D, Jin H, McEliece R: Coding theorems for \"turbo-like\" codes. In Proc. 36th Allerton Conference on Communications, Control, and Computing. Illinois: Allerton House, Monticello; 23\u201325 September 1998:201-210."},{"key":"665_CR21","volume-title":"Proc. ICC'2006","author":"O Muller","year":"2006","unstructured":"Muller O, Baghdadi A, J\u00e9z\u00e9quel M: On the parallelism of convolutional turbo decoding and interleaving interference. In Proc. ICC'2006. San Francisco; 2006."},{"issue":"2","key":"665_CR22","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/TCOMM.2004.841982","volume":"53","author":"J Zhang","year":"2005","unstructured":"Zhang J, Fossorier M: Shuffled iterative decoding. IEEE Trans Commun 2005, 53(2):209-213. 10.1109\/TCOMM.2004.841982","journal-title":"IEEE Trans Commun"},{"issue":"2","key":"665_CR23","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"T Richardson","year":"2001","unstructured":"Richardson T, Urbanke R: The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory 2001, 47(2):599-618. 10.1109\/18.910577","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"665_CR24","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1109\/18.910579","volume":"47","author":"T Richardson","year":"2001","unstructured":"Richardson T, Urbanke R: Efficient encoding of low-density parity-check codes. IEEE Trans. Inform. Theory 2001, 47(2):638-656. 10.1109\/18.910579","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"665_CR25","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4234.905935","volume":"5","author":"S Chung","year":"2001","unstructured":"Chung S, Forney G Jr, Richardson T, Urbanke R: On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Commun Lett 2001, 5(2):58-60.","journal-title":"IEEE Commun Lett"},{"issue":"2","key":"665_CR26","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/18.910580","volume":"47","author":"S Chung","year":"2001","unstructured":"Chung S, Richardson T, Urbanke R: Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. IEEE Trans. Inform. Theory 2001, 47(2):657-670. 10.1109\/18.910580","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"665_CR27","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/18.910581","volume":"47","author":"H El Gamal","year":"2001","unstructured":"El Gamal H, Hammons AR Jr: Analyzing the turbo decoder using the Gaussian approximation. IEEE Trans. Inform. Theory 2001, 47(2):671-686. 10.1109\/18.910581","journal-title":"IEEE Trans. Inform. Theory"},{"key":"665_CR28","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S1571-0653(04)00195-7","volume":"6","author":"H Sawaya","year":"2001","unstructured":"Sawaya H, Vialle S, Boutros J, Z\u00e9mor G: Performance limits of compound codes with symbol-based iterative decoding. Electronic Notes in Discrete Mathematics 2001, 6: 433-443.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"665_CR29","first-page":"75","volume-title":"3rd IEEE\/ITG Conf Source and Channel Coding","author":"S ten Brink","year":"2000","unstructured":"ten Brink S: Iterative decoding trajectories of parallel concatenated codes. In 3rd IEEE\/ITG Conf Source and Channel Coding. Munich, Germany; 17\u201319 January 2000:75-80."},{"key":"665_CR30","doi-asserted-by":"crossref","unstructured":"Selection procedure of turbocode parameters by combinatorial optimization In 6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC). Brest; Sept 2010:156-160.","DOI":"10.1109\/ISTC.2010.5613825"},{"issue":"9","key":"665_CR31","doi-asserted-by":"publisher","first-page":"2516","DOI":"10.1109\/TCOMM.2010.09.080325","volume":"58","author":"GM Kraidy","year":"2010","unstructured":"Kraidy GM, Savin V: Capacity-approaching irregular turbo codes for the binary erasure channel. IEEE Trans. Com. 2010, 58(9):2516-2524.","journal-title":"IEEE Trans. Com"},{"issue":"1","key":"665_CR32","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra E: A note on two problems in connexion with graphs. Numer Math 1959, 1(1):269-271. 10.1007\/BF01386390","journal-title":"Numer Math"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1687-1499-2013-115\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-115.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-115.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T06:36:53Z","timestamp":1745995013000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/1687-1499-2013-115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,26]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["665"],"URL":"https:\/\/doi.org\/10.1186\/1687-1499-2013-115","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2013,4,26]]},"article-number":"115"}}