{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:09:20Z","timestamp":1776398960419,"version":"3.51.2"},"reference-count":10,"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\/bf02998578","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:33:51Z","timestamp":1625639631000},"page":"173-182","source":"Crossref","is-referenced-by-count":9,"title":["New results on serial concatenated and accumulated-convolutional turbo code performance","Nouveaux r\u00e9sultats sur les performances des turbo codes s\u00e9ries construits \u00e0 partir de codes convolutifs avec accumulation"],"prefix":"10.1007","volume":"54","author":[{"given":"Audrey M.","family":"Viterbi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Viterbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02998578_CR1","doi-asserted-by":"crossref","unstructured":"Berrou (C.), Glavieux (A.), Thitimajshima (P.). Near Shannon limit error correcting coding and decoding: turbo codes, Proc. of International Conference on Communications, pp. 1064\u20131070, Geneva, Switzerland, (May 23\u201326, 1993).","DOI":"10.1109\/ICC.1993.397441"},{"issue":"2","key":"BF02998578_CR2","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,IEEE Trans. Information Theory,42, no 2, pp. 409\u2013428, (March 1996).","journal-title":"IEEE Trans. Information Theory"},{"key":"BF02998578_CR3","unstructured":"Benedetto (S.), Montorsi (G.), Divsalar (D.), Pollara (F.), Serial concatenation of interleaved codes: performance analysis, design and iterative decoding,JPL TDA Progress Report 42\u2013126, (August 15, 1996)."},{"key":"BF02998578_CR4","doi-asserted-by":"publisher","first-page":"9525","DOI":"10.1073\/pnas.94.18.9525","volume":"94","author":"(A. J.) Viterbi","year":"1997","unstructured":"Viterbi (A. J.), Viterbi (A. M.), Sindhushayana (N. T.). Interleaved concatenated codes: new perspectives on approaching the Shannon limit,Proc. Natl. Acad. Sci,94, pp. 9525\u20139531, (September, 1997).","journal-title":"Proc. Natl. Acad. Sci"},{"key":"BF02998578_CR5","unstructured":"Divsalar (D.), Jin (H.), McEliece (R.), Coding theorems for turbo-like codes,Jet Propulsion Laboratory, Pasadena, CA, (September 1998). See also D. Divsalar and F. Pollara, Serial and hybrid concatenated codes with applications,Proceedings of the International Symposium on Turbo Codes and Related Topics, Brest. Fr. (September, 1997)."},{"key":"BF02998578_CR6","volume-title":"Principles of digital communication and coding","author":"(A. J.) Viterbi","year":"1979","unstructured":"Viterbi (A. J.), Omura (J. K.), Principles of digital communication and coding,McGraw-Hill, NY, 1979"},{"key":"BF02998578_CR7","doi-asserted-by":"crossref","unstructured":"Duman (T. M), Salehi (M.), New performance bounds for turbo codes,Proc. of 1997 Global Communications Conference (Globe- com\u201997), pp. 634\u2013638, USA, Phoenix, Arizona, (November 4\u20138, 1997).","DOI":"10.1109\/GLOCOM.1997.638407"},{"key":"BF02998578_CR8","unstructured":"Viterbi (A. M.), Viterbi (A. J.), Improved union bound on linear codes for the input-binaryAwgn channel with applications to turbo-codes,Proc. 1998 IEEE Intl. Symp. On Information Theory, MIT, Cambridge, MA, (August, 1998)."},{"key":"BF02998578_CR9","volume-title":"Improved upper bounds on the decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum","author":"(I.) Sason","year":"1998","unstructured":"Sason (I.), Shamai (Shitz) (S.), Improved upper bounds on the decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum,Technion, Haifa, Israel, (February, 1998)."},{"issue":"10","key":"BF02998578_CR10","first-page":"1261","volume":"40","author":"(G.) Poltyrev","year":"1996","unstructured":"Poltyrev (G.), Bounds on the decoding error probablity of binary linear codes via their spectra,IEEE Trans.IT. 40, no 10, pp. 1261\u20131271, (October, 1996).","journal-title":"IEEE Trans.IT."}],"container-title":["Annales Des T\u00e9l\u00e9communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02998578.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02998578\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02998578.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T14:49:59Z","timestamp":1725374999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02998578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":10,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["BF02998578"],"URL":"https:\/\/doi.org\/10.1007\/bf02998578","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}