{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T06:14:07Z","timestamp":1744697647146},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. T\u00e9l\u00e9commun."],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/bf03219808","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:33:22Z","timestamp":1625639602000},"page":"79-102","source":"Crossref","is-referenced-by-count":1,"title":["On multiple slice turbo codes"],"prefix":"10.1007","volume":"60","author":[{"given":"David","family":"Gnaedig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Boutillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"J\u00c9Z\u00e9quel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent C.","family":"Gaudet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Glenn","family":"Gulak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03219808_CR1","unstructured":"Berrou (C.),Glavieux (A.),Thitimajshima (P.), Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes, inProceedings of the ieee International Conference on Communications, Geneva, Switzerland, pp. 1064\u20131070, May 1993."},{"issue":"6","key":"BF03219808_CR2","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1109\/TVLSI.2002.808451","volume":"10","author":"(Z.) Wang","year":"2002","unstructured":"Wang (Z.), Chi (Z.), Parhi (K.K.), Area-Efficient High Speed Decoding Schemes for Turbo\/MAP Decoders,IEEE Transactions on VLSI Systems,10, no 6, pp. 902\u2013912, Dec. 2002.","journal-title":"IEEE Transactions on VLSI Systems"},{"key":"BF03219808_CR3","unstructured":"Worm (A.),Lamm (H.),Wehn (N.), VLSI architectures for high speed MAP decoders,in Proceedings of the 14th International Conference on VLSI Design, pp 446\u2013453, 2001."},{"issue":"3\u20134","key":"BF03219808_CR4","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BF02998577","volume":"54","author":"(C.) Berrou","year":"1999","unstructured":"Berrou (C.), Douillard (C.), J\u00e9z\u00e9quel (M.), Multiple parallel concatenation of circular recursive systematic codes, inAnnales des T\u00e9l\u00e9communications,54, no 3\u20134, pp 166\u2013172, 1999.","journal-title":"Annales des T\u00e9l\u00e9communications"},{"key":"BF03219808_CR5","unstructured":"Dobkin (R.),Peleg (M),Ginosar (R.), Parallel VLSI Architecture for MAP Turbo Decoder, inProceedings of pimrc 2002, Lisboa, Portugal, Sept. 2002."},{"key":"BF03219808_CR6","unstructured":"Boutillon (E.),Castura (J.),Kschischang (R.F.), Decoder-first code design, inProceedings of the 2 nd International Symposium on Turbo Codes and Related Topics, pp 459\u2013462, Sept 2000."},{"key":"BF03219808_CR7","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1109\/18.556666","volume":"42","author":"(L.C.) Perez","year":"1996","unstructured":"Perez (L.C.), Seghers (J.), Costello (D.J.) Jr., A distance spectrum interpretation of turbo codes,IEEE Transactions on Information Theory,42, pp. 1698\u20131709, Nov. 1996.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"BF03219808_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/18.485713","volume":"42","author":"(S.) Benedetto","year":"1996","unstructured":"Benedetto (S.), Montorsi (G.), Unveiling turbo-codes: some results on parallel concatenated coding schemes\u2019,IEEE Transactions on Information Theory,42, no 2, pp. 409\u2013429, Mars 1996.","journal-title":"IEEE Transactions on Information Theory"},{"key":"BF03219808_CR9","first-page":"93","volume":"1","author":"(J.) Hokfelt","year":"1999","unstructured":"Hokfelt (J.), Edfors (O.), Maseng (T.), Interleaver Design for Turbo Codes Based on the Performance of Iterative Decoding, inProceeding of the IEEE International Conference on Communications,1, pp.93\u201397, 1999.","journal-title":"Proceeding of the IEEE International Conference on Communications"},{"key":"BF03219808_CR10","doi-asserted-by":"crossref","unstructured":"Berrou (C.),Douillard (C.),J\u00e9z\u00e9quel (M.), Designing turbo codes for low error rates, inProceedings of IEE Colloquium : \u00abTurbo codes in digital broadcasting \u2014 Could it double capacity?\u00bb, London, Nov. 1999.","DOI":"10.1049\/ic:19990781"},{"key":"BF03219808_CR11","unstructured":"dvb-rcs Standard, Interaction channel for satellite distribution systems,etsi en 301 790, V1.2.2, pp. 21\u201324, Dec 2000."},{"key":"BF03219808_CR12","unstructured":"Douillard (C.),J\u00e9z\u00e9quel (M.),Berrou (C.),Brengarth (N.),Tousch (J.),Pham (N.), The Turbo Code Standard fordvb-rcs,in Proceedings of the 2 nd International Symposium on Turbo Codes and Related Topics, pp. 535\u2013538, Brest, France, Sept. 2000."},{"key":"BF03219808_CR13","unstructured":"Crozier (S.), New High-Spread High-Distance Interleavers for Turbo-Codes,20 th biennial Symposium on Communications, pp. 3\u20137, Kingston, Canada 2000."},{"issue":"3","key":"BF03219808_CR14","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1023\/A:1013821922527","volume":"37","author":"(D.V.) Thruhachev","year":"2001","unstructured":"Thruhachev (D.V.), Lentmaier (M.), Zigangirov (K. Sh.), Some Results Concerning Design and Decoding of Turbo-Codes,in Problems of Information Transmission,37, No. 3, pp. 190\u2013205, 2001.","journal-title":"Problems of Information Transmission"},{"key":"BF03219808_CR15","doi-asserted-by":"crossref","unstructured":"Heegard (C.),Wicker (S. B.), Turbo Coding,Kluwer Academic Publishers, pp.50\u201353, 1999.","DOI":"10.1007\/978-1-4757-2999-3"},{"key":"BF03219808_CR16","doi-asserted-by":"crossref","unstructured":"Berrou (C.),Saouter(Y.),Douillard (C.),Kerouedan (S.),Jezequel (M.), Designing good permutations for turbo codes: towards a single model,in Proceedings of the International Conference on Communications, Paris, June 2004.","DOI":"10.1109\/ICC.2004.1312507"},{"key":"BF03219808_CR17","unstructured":"Berrou (C.),Vaton (S.),Jezequel (M.),Douillard (C.), Computing the minimum distance of linear codes by the error impulse method,Proceedings of globecom 2002, Taipei, Taiwan, Nov 2002."},{"issue":"2","key":"BF03219808_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/TCOMM.2003.809247","volume":"51","author":"(E.) Boutillon","year":"2003","unstructured":"Boutillon (E.), Gross (W.J.), Gulak (P.G), VLSI Architectures for the map Algorithm,IEEE Transanctions On Communications,51, No.2, pp. 175\u2013185, 2003.","journal-title":"IEEE Transanctions On Communications"},{"key":"BF03219808_CR19","unstructured":"Robertson (P.),Villebrun (E.),Hoeher (P.), A Comparison of Optimal and Sub-optimal Decoding Algorithm in the Log Domain, inProceedings IEEE International Conference on Communications, Seattle,wa, pp. 1009\u20131013, June 1995."},{"key":"BF03219808_CR20","unstructured":"Gnaedig (D.),Boutillon (E.),J\u00e9z\u00e9quel (M.), Design of Three-Dimensional Multiple Slice Turbo Codes,submitted to the special issue on Turbo Processing, eurasip Journal on Applied Signal Processing."}],"container-title":["Annales Des T\u00e9l\u00e9communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03219808.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF03219808\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03219808.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T03:52:40Z","timestamp":1672717960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF03219808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["BF03219808"],"URL":"https:\/\/doi.org\/10.1007\/bf03219808","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}