{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:25:57Z","timestamp":1772022357395,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"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":[[1999,3]]},"DOI":"10.1007\/bf02998577","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:33:51Z","timestamp":1625639631000},"page":"166-172","source":"Crossref","is-referenced-by-count":37,"title":["Multiple parallel concatenation of circular recursive systematic convolutional (Crsc) codes","Concat\u00e9nation parall\u00e8le multiple de codes convolutifs r\u00e9cursifs syst\u00e9matiques circulaires"],"prefix":"10.1007","volume":"54","author":[{"given":"Claude","family":"Berrou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Douillard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"J\u00e9z\u00e9quel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02998577_CR1","doi-asserted-by":"crossref","unstructured":"Shannon (C. E.). A mathematical theory of communication.Bell System Technical Journal,27. (July and October 1948).","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"BF02998577_CR2","unstructured":"*** Draftccsds recommendation for telemetry channel coding (updated to include turbo codes).Consultative Committee for Space Data Systems, Rev. 4, (May 1998)."},{"issue":"10","key":"BF02998577_CR3","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1109\/26.539767","volume":"44","author":"(C.) Berrou","year":"1996","unstructured":"Berrou (C.), Glavieux (A.). Near optimum error correcting coding and decoding: turbo-codes,IEEE Trans. Cam,44, no 10, pp. 1261\u20131271, (Oct. 1996).","journal-title":"IEEE Trans. Cam"},{"key":"BF02998577_CR4","unstructured":"Berrou (C.), Glavieux (A.). Turbo codes, general principles and applications,Proc. of the 6th Int. Tirrenia Workshop on Digital Communications, Pisa, Italy, pp. 215\u2013226, (Sept. 1993)."},{"key":"BF02998577_CR5","unstructured":"Thitimajshima (P.). Les codes convolutifs r\u00e9cursifs syst\u00e9ma- tiques et leur application \u00e0 la concat\u00e9nation parall\u00e8le. Ph. D. no 284,Universit\u00e9 de Bretagne Occidentale, Brest, France, (Dec. 1993)."},{"key":"BF02998577_CR6","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TIT.1974.1055186","volume":"20","author":"(L. R.) Bahl","year":"1974","unstructured":"Bahl (L. R.), Cocke (J.), Jelinek (E.), Raviv (J.). Optimal decoding of linear codes for minimizing symbol error rate,IEEE Trans. Inform. Theory,20, pp. 248\u2013287, (Mar. 1974).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF02998577_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/ett.4460080202","volume":"8","author":"(P.) Robertson","year":"1997","unstructured":"Robertson (P.), Hoeher (P.), Villebrun (E.). Optimal and suboptimal maximum a posteriori algorithms suitable for turbo decoding,European Trans. Telecommim..,8, pp. 119\u2013125. (March-Apr. 1997).","journal-title":"European Trans. Telecommim."},{"issue":"1\u20132","key":"BF02998577_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02996166","volume":"42","author":"(G.) Battail","year":"1987","unstructured":"Battail (G.). Pond\u00e9ration des symboles d\u00e9cod\u00e9s par l\u2019algo- rithme de Viterbi,Ann. T\u00e9l\u00e9commun., Fr.,42, no 1\u20132. pp. 31\u201338, (Jan. 1987).","journal-title":"Ann. T\u00e9l\u00e9commun., Fr."},{"key":"BF02998577_CR9","unstructured":"Hagenauer (J.), Hoeher (P.). A Viterbi algorithm with soft-decision outputs and its applications,Proc. of Globecom 89, Dallas, Texas, pp. 47. 11\u201347\u201317, (Nov. 1989)."},{"key":"BF02998577_CR10","doi-asserted-by":"crossref","unstructured":"Berrou (C.),Adde (P.),Angui (E.),Faudeil (S.). A low complexity soft-output Viterbi decoder architecture,Proc. of ICC \u201993, Geneva, pp. 737\u2013740, (May 1993).","DOI":"10.1109\/ICC.1993.397371"},{"issue":"2","key":"BF02998577_CR11","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 concatenared coding schemes,IEEE Trans. IT.,42, no 2, pp. 409\u2013429, (Mar. 1996).","journal-title":"IEEE Trans. IT."},{"key":"BF02998577_CR12","unstructured":"Berrou (C.). Some clinical aspects of turbo codes,Proc. of Int. Symposium on Turbo Codes, Brest, France, pp. 26\u201331, (Sept. 1997)."},{"issue":"23","key":"BF02998577_CR13","doi-asserted-by":"publisher","first-page":"2228","DOI":"10.1049\/el:19981537","volume":"34","author":"Li Ping","year":"1998","unstructured":"Li Ping. Modified turbo codes with low decoding complexity.Electronics. Letters,34, no 23, pp. 2228\u20132229, (Nov. 1998).","journal-title":"Electronics. Letters"},{"key":"BF02998577_CR14","doi-asserted-by":"crossref","unstructured":"Pierce (J.N.). Limit distribution of the minimum distance of random linear codes,IEEE Trans. IT,13, no 4, (Oct. 1967).","DOI":"10.1109\/TIT.1967.1054053"},{"issue":"5","key":"BF02998577_CR15","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1002\/ett.4460060510","volume":"6","author":"(Y. V.) Svirid","year":"1995","unstructured":"Svirid (Y. V.), Weight distributions and bounds for turbo codes \u00bb,Eur. Trans. Telecomm.,6, no 5, pp. 543\u2013555, (Sept.\/Oct. 1995).","journal-title":"Eur. Trans. Telecomm."},{"key":"BF02998577_CR16","unstructured":"Battail (G.). Theorie de l\u2019information, application aux techniques de communication,Masson, Paris, (1997)."}],"container-title":["Annales Des T\u00e9l\u00e9communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02998577.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02998577\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02998577.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T14:50:10Z","timestamp":1725375010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02998577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":16,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["BF02998577"],"URL":"https:\/\/doi.org\/10.1007\/bf02998577","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}