伯劳指出他们的工作证明并非总是需要知道理论的极限才能达到这些极限。这使人们想起一个法国 著名的笑话：傻瓜不知道这件事是没法做到的，因此他就做到了 References [1]C.Berrou and A.Glavicux"Near opimum rror coding and decoding Turb -codes,"IEEE Trans.C 0mmm,vol.44,no.10,pp.1261-l271,0ct1996 [2]J.Hagenauer,E.Offer and L.Papke,"Iterative decoding of binary block and convolutional codes,"IEEE Trans.Inform.Theory,vol.42,no.2,pp.429-445,Mar.1996. [3]S.Benedetto and G Montorsi,"Unveiling turbo codes:Some results on parallel concatenated coding schemes,"IEEE Trans.Inform.Theory,vol.42,no2,pp409-428. Mar.1996. [4]S.Shamai and I.Sason,"Variations on the Gallager bounds.connections and applications,"IEEE Trans.Inform.Theory,vol.48,no.12,pp.3029,Dec.2002. [5]I.Sason and S.Shamai,"On improved bounds on the decoding error probability of block codes over interleaved fading channels,with applications to turbo-like codes,"IEEE Trans inform Theory vol 47 ,n0.6,Pp.2275-2299,Sep.2001. [6]T.M.Duma and M.Salehi ew perfor rmance bounds for turbo codes,"IEEE Trans Commun.,vol.46,no.6.pp.717.June 1998 [7]C.B.Schlegel and L.C.Perez,Trellis and Turbo Coding.IEEE Press,NJ,2004. [8]S.ten Brink,"Convergence behavior of iteratively decoded parallel concatenated codes", IEEE Trans.Commun.vol.49,no.10.pp.1727-1737,Oct.2001. ofThe EEE.Special is e on n Turbo info rmation processing:Algorithms. mplementations and applications,vol5,200 [10]W.E.Ryan and Shu Lin,Channel Codes:Classical and Modern.Cambridge University Press,2009. 457 4-57 伯劳指出他们的工作证明并非总是需要知道理论的极限才能达到这些极限。这使人们想起一个法国 著名的笑话：傻瓜不知道这件事是没法做到的，因此他就做到了。 References [1] C. Berrou and A.Glavieux, “Near optimum error correcting coding and decoding: Turbo-codes,” IEEE Trans. Commun., vol. 44, no.10, pp.1261-1271, Oct. 1996. [2] J. Hagenauer, E. Offer and L. Papke, “Iterative decoding of binary block and convolutional codes,” IEEE Trans. Inform. Theory, vol.42, no.2, pp.429-445, Mar. 1996. [3] S. Benedetto and G. Montorsi, “Unveiling turbo codes: Some results on parallel concatenated coding schemes,” IEEE Trans. Inform. Theory, vol.42, no.2, pp.409-428, Mar. 1996. [4] S. Shamai and I. Sason, “Variations on the Gallager bounds, connections and applications,” IEEE Trans. Inform. Theory, vol.48, no.12, pp.3029, Dec. 2002. [5] I. Sason and S. Shamai, “On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes,” IEEE Trans. Inform. Theory, vol.47, no.6, pp.2275-2299, Sep. 2001. [6] T. M. Duman and M. Salehi, “New performance bounds for turbo codes,” IEEE Trans. Commun., vol.46, no.6, pp.717, June 1998. [7] C. B. Schlegel and L. C. Perez, Trellis and Turbo Coding. IEEE Press, NJ, 2004. [8] S. ten Brink, “Convergence behavior of iteratively decoded parallel concatenated codes”, IEEE Trans. Commun., vol.49, no.10, pp.1727-1737, Oct. 2001. [9] Proceedings of The IEEE, Special issue on Turbo-information processing: Algorithms, implementations and applications, vol.95, no.6, June 2007. [10] W. E. Ryan and Shu Lin, Channel Codes: Classical and Modern. Cambridge University Press, 2009