{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:09:18Z","timestamp":1776398958565,"version":"3.51.2"},"reference-count":38,"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\/bf02998579","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:33:51Z","timestamp":1625639631000},"page":"183-200","source":"Crossref","is-referenced-by-count":11,"title":["Bounds on the error probability ofml decoding for block and turbo-block codes","Bornes de la probabilit\u00e9 d\u2019erreur pour des codes en blocs et des turbo codes en blocs avec d\u00e9codage \u00e0 maximum de vraisemblance"],"prefix":"10.1007","volume":"54","author":[{"given":"Igal","family":"Sason","sequence":"first","affiliation":[]},{"given":"Shlomo","family":"Shamai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02998579_CR1","doi-asserted-by":"crossref","unstructured":"Adde (P.), Pyndiah (R.), Raoul (O.). Performance and complexity of block turbo decoder circuits,Proceedings of the Third IEEE International Conference on Electronics, Circuits and Systems (ICECS \u201996), pp. 172\u2013175, New-York, USA, (1996).","DOI":"10.1109\/ICECS.1996.582746"},{"key":"BF02998579_CR2","unstructured":"Adde (P.), Pyndiah (R.), Raoul (O.), Inlsan (J. R.). Turbo block decoder design,Proceedings of the International Symposium on Turb Codes and Related Topics, pp. 166\u2013169, Brest, France, (3\u20135 September 1997)."},{"key":"BF02998579_CR3","doi-asserted-by":"crossref","unstructured":"Aitsab (O.), Pyndiah (R.). Performance of Reed-Solomon block turbo code,Proceedings of the IEEE GLOBECOM 1996, pp. 121\u2013125, London, England, (18\u201321 November 1996).","DOI":"10.1109\/GLOCOM.1996.594345"},{"key":"BF02998579_CR4","first-page":"342","volume":"25","author":"(L. R.) Bahl","year":"1979","unstructured":"Bahl (L. R.), Cocke (J.), Jelinek (J.), Raviv (J.). Optimal decoding of linear codes for minimizing symbol error rate.IEEE Trans, on Information Theory,25, pp. 342\u2013345, (1979).","journal-title":"IEEE Trans, on Information Theory"},{"key":"BF02998579_CR5","unstructured":"Barbulescu (S. A.). Iterative decoding of turbo codes and other concatenated codes,Ph.D. dissertation, Faculty of Engineering, University of South Australia, (February 1996)."},{"issue":"2","key":"BF02998579_CR6","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, on Information Theory,42, no 2, pp. 409\u2013428, (March 1996).","journal-title":"IEEE Trans, on Information Theory"},{"issue":"3","key":"BF02998579_CR7","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/18.669119","volume":"44","author":"(S.) Benedetto","year":"1998","unstructured":"Benedetto (S.), Divsalar (D.), Montorsi (G.), Pollara (F.). Serial concatenation of interleaved codes: performance, analysis, design and iterative decoding,IEEE Trans, on Information Theory,44, no 3, pp. 909\u2013926, (May 1998).","journal-title":"IEEE Trans, on Information Theory"},{"key":"BF02998579_CR8","volume-title":"Seminar on Turbo Coding","author":"(C.) Berrou","year":"1996","unstructured":"Berrou (C.), Evano (S.) Battail (G.). Turbo-block-codes,Seminar on Turbo Coding, Lund University, Sweden, (28\u201329 August 1996)."},{"key":"BF02998579_CR9","first-page":"60","volume-title":"Proceedings 1998 IEEE International Symposium on Information Theory (ISIT \u201998)","author":"(G.) Buch","year":"1998","unstructured":"Buch (G.), Burkert (F.). Unequal error protection with productlike turbo codes,Proceedings 1998 IEEE International Symposium on Information Theory (ISIT \u201998), p. 60, MIT Cambridge, MA, USA, (16\u201321 August 1998)."},{"key":"BF02998579_CR10","volume-title":"Proceedings 1995 IEEE International Symposium on Information Theory","author":"(J. F.) Cheng","year":"1995","unstructured":"Cheng (J. F.), McEliece (R. J.). Unit-memory Hamming turbo codes,Proceedings 1995 IEEE International Symposium on Information Theory, Whistler, British Columbia, Canada, (17\u201322 September, 1995)."},{"key":"BF02998579_CR11","unstructured":"Divsalar (D.), Jin (H.), McEliece (R. J.). Coding theorems for turbo-like codes,1998 Allerton Conference, (23\u201325 September. 1998)."},{"key":"BF02998579_CR12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low density parity check codes","author":"(R.G.) Gallager","year":"1963","unstructured":"Gallager (R.G.). Low density parity check codes,MIT Press, Cambridge, Mass., (1963)."},{"key":"BF02998579_CR13","doi-asserted-by":"crossref","unstructured":"Goalic (A.), Pyndiah (R.). Real-time turbo-decoding of product codes on a digital signal processor,Proceedings of IEEE Globecorn 1997, pp. 624\u2013628, Phoenix. Arizona USA, (3\u20138 November 1997).","DOI":"10.1109\/GLOCOM.1997.638405"},{"key":"BF02998579_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BFb0025138","volume-title":"Information Theory and Applications II, 4th Canadian Workshop","author":"(P.) Guinand","year":"1996","unstructured":"Guinand (P.), Lodge (J.), Papke (L.). An alternative approach to the design of interleavers for block-turbo codes,Information Theory and Applications II, 4th Canadian Workshop, Canada, May 1995. Selected Papers:Springer-Verlag, pp. 95\u2013103, Berlin, Germany, (1996)."},{"issue":"2","key":"BF02998579_CR15","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1109\/18.485714","volume":"42","author":"(J.) Hacenauer","year":"1996","unstructured":"Hacenauer (J.).Offer (E.), Papke (L.). Iterative decoding of binary block and convolutional codes,IEEE Trans, on Information Theory,42, no 2, pp. 429\u2013445, (March 1996).","journal-title":"IEEE Trans, on Information Theory"},{"key":"BF02998579_CR16","volume-title":"Mediterranean Workshop on Coding and Information Integrity","author":"(J.) Huber","year":"1996","unstructured":"Huber (J.), Schetelig (M.), Wachsmann (U.). Turbo codes over simple block codes and turboproduct codes,Mediterranean Workshop on Coding and Information Integrity, Palma De Mal- lorca, Spain, (28 February, 1996)."},{"issue":"1\u20134","key":"BF02998579_CR17","first-page":"262","volume":"23","author":"(G. L.) Katsman","year":"1987","unstructured":"Katsman (G. L.), Tsafsman (M. A.). Spectra of algebraic geometric codes.Problems of Information Transmission,23, no 1\u20134, pp. 262\u2013275, (1987).","journal-title":"Problems of Information Transmission"},{"key":"BF02998579_CR18","first-page":"149","volume-title":"Proceedings 1998 IEEE International Symposium on Information Theory (ISIT \u201998)","author":"(M.) Lentmaier","year":"1998","unstructured":"Lentmaier (M.), Ziganoirov (K. Sh.). Iterative decoding of generalized low-density parity-check codes,Proceedings 1998 IEEE International Symposium on Information Theory (ISIT \u201998), MIT Cambridge, MA, USA, p. 149, (16\u201321 August 1998)."},{"key":"BF02998579_CR19","doi-asserted-by":"crossref","unstructured":"Lodge (J.), Young (R.), Hoeher (P.), Hagenaubr (J.). Separable MAP \u2018filters\u2019 for the decoding of product and concatenated codes,Proceedings of the IEEE International Conference on Communications ICC\u201993, pp. 1740\u20131745, Geneva, Switzerland, (23\u201326 May. 1993).","DOI":"10.1109\/ICC.1993.397580"},{"key":"BF02998579_CR20","unstructured":"Lucas (R.). On iterative soft-decision decoding of linear binary block codes,Ph.D. dissertation, Univ. Ulm, Germany, (1997)."},{"issue":"2","key":"BF02998579_CR21","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/49.661116","volume":"16","author":"(R.) Lucas","year":"1998","unstructured":"Lucas (R.).Bossert (M.), Breitbach (M.). On iterative soft- decision decoding of linear binary block codes and product codes,IEEE Journal on Selected Areas in Communications,16, no 2, pp. 276\u2013296, (February 1998).","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"7","key":"BF02998579_CR22","first-page":"3014","volume":"44","author":"(M.) Moher","year":"1998","unstructured":"Moher (M.), Gulliver (T. A.). Cross-entropy and iterative decoding.IEEE Irans. on Information Theory,44, no 7, pp. 3014- 3097, (November 1998).","journal-title":"IEEE Irans. on Information Theory"},{"issue":"3","key":"BF02998579_CR23","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/18.568717","volume":"43","author":"(H. T.) Moorthy","year":"1997","unstructured":"Moorthy (H. T.), Lin (S.), Kassami (T.). Soft decision decoding of binary linear block codes based on iterative search algorithm,IEEE Trans. On Information Theory,43, no 3, pp. 1030\u20131039, (May 1997).","journal-title":"IEEE Trans. On Information Theory"},{"issue":"5","key":"BF02998579_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/4234.625034","volume":"1","author":"(H.) Nickl","year":"1997","unstructured":"Nickl (H.), Hacenauer (J.), Burkert (F.). Approaching Shannon\u2019s capacity limit by 0.27 dB using simple Hamming codes,IEEE Communications Letters,1, no 5, pp. 130\u2013132, (September 1997). See also:Nickl (H.),Hacenauer (J.),Burkert (F.), The race to Shannon\u2019s limit: Discipline high-rate codes,Proceedings of the International Symposium on Turbo Codes and Related Topics, pp. 239-242, Brest, France, (3\u20135 September 1997).","journal-title":"IEEE Communications Letters"},{"key":"BF02998579_CR25","unstructured":"Ping (L.). Chan (S.), Yeung (K. L.). Iterative decoding of multidimensional concatenated single parity check codes.Proceedings 1998 IEEE International Conference on Communications, Atlanta, USA, (June 1998)."},{"key":"BF02998579_CR26","first-page":"427","volume":"40","author":"(G. Poltyrev","year":"1994","unstructured":"Poltyrev (G.). Bounds on the decoding error probability of binary linear codes via their spectra,IEEE Trans, on Information Theory,40, no 4, (July 1994). See also:Herzberg (H.),Poltyrev (G.). The error probability of M-aryPsk block coded modulation schemes,IEEE Trans, on Communications,44, no 4, pp. 427\u2013433. (April 1996).","journal-title":"IEEE Trans, on Information Theory"},{"key":"BF02998579_CR27","unstructured":"Pyndiah (R.), Glavieux (A.), Picart (A.), Jacq (S.). Near optimum decoding of product codes.Proceedings of IEEE Globecom 1994 Conference, pp. 339\u2013343, San Francisco. USA. (28 November-2nd December, 1994)."},{"key":"BF02998579_CR28","doi-asserted-by":"crossref","unstructured":"Pyndiah (R.), Picart (A.), Glavieux (A.). Performance of block turbo coded 16-Qam and 64-Qam modulations,Proceedings of IEEE Globecom 1995 Conference, pp. 1039\u20131043, Singapore. (13\u201317 November 1995).","DOI":"10.1109\/GLOCOM.1995.502563"},{"key":"BF02998579_CR29","doi-asserted-by":"crossref","unstructured":"Pyndiah (R.), Combelles (P.), Adde (P.). A very low complexity block turbo decoder for product codes,Proceedings of IEEE Globecom 1996, pp. 101\u2013105, London, England, (18\u201322 November 1996).","DOI":"10.1109\/GLOCOM.1996.594341"},{"key":"BF02998579_CR30","unstructured":"Pyndiah (R.). Iterative decoding of product codes: block turbo codes,Proceedings of the International Symposium on Turbo Codes and Related Topics, pp. 71\u201379. Brest, France, (3\u20135 September 1997)."},{"issue":"8","key":"BF02998579_CR31","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/26.705396","volume":"46","author":"(R.) Pyndiah","year":"1998","unstructured":"Pyndiah (R.). Near optimum decoding of product codes: block turbo codes,IEEE Trans, on Communications.46, no 8, pp. 1003\u20131010, (August 1998).","journal-title":"IEEE Trans, on Communications"},{"key":"BF02998579_CR32","unstructured":"Sason (I.), Shamai (S.) (Shitz). Improved upper bounds on the decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum, Technical Report No CC-237, Technion- Israel Institute of Technology, February 1998. To appear inIEEE Trans, on Information Theory. See also:Proceedings 1998 IEEE International Symposium on Information Theory (ISIT \u201998). p. 30. MIT, Cambridge. MA. USA, (16\u201321 August 1998)."},{"key":"BF02998579_CR33","unstructured":"Sason (I.), Shamai (S.) (Shitz). Gallager\u2019s 1963 bound: Extensions and Observations,Technical Report No CC-258, Technion. (October 1998)."},{"key":"BF02998579_CR34","unstructured":"Schaffler (S.), Hagenauer (J.). Soft decision MAP decoding of binary linear block via global optimization,Proceedings 1997 IEEE International Symposium on Information Theory (ISIT \u201997), p. 231, Ulm, Germany."},{"key":"BF02998579_CR35","unstructured":"Soljanin (E.), Urbanke (R.). On the performance of recursive decoding schemes,Proceedings 1997 IEEE International Symposium on Information Theory (ISIT \u201997), p. 9, Ulm, Germany. See also: Bell Laboratories, Lucent Technologies, Technical Report 1997."},{"issue":"5","key":"BF02998579_CR36","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,European Trans, on Telecommunications (ETT).6 no 5. pp. 543\u2013555. (Sept.\u2013Oct. 1995).","journal-title":"European Trans, on Telecommunications (ETT)"},{"key":"BF02998579_CR37","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/0012-365X(92)90579-5","volume":"106\/107","author":"(L.) Tulhuizen","year":"1992","unstructured":"Tulhuizen (L.), Baggen (S.). On the weight enumerator of product codes.Discrete Mathematics,106\/107, pp. 483\u2013488. (1992).","journal-title":"Discrete Mathematics"},{"key":"BF02998579_CR38","first-page":"267","volume-title":"Proceedings 1998 IEEE International Symposium on Information Theory (ISIT \u201998)","author":"(L.) Tulhuizen","year":"1998","unstructured":"Tulhuizen (L.), Baggen (S.).Nowacka (E. H.), Union bounds on the performance of product codes.Proceedings 1998 IEEE International Symposium on Information Theory (ISIT \u201998). p. 267. MIT, Cambridge, MA, USA. (16\u201321 August, 1998)."}],"container-title":["Annales Des T\u00e9l\u00e9communications"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02998579.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02998579\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02998579.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T14:50:58Z","timestamp":1725375058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02998579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":38,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["BF02998579"],"URL":"https:\/\/doi.org\/10.1007\/bf02998579","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}