The ten-year-old turbo codes are entering into service
暂无分享,去创建一个
[1] Sae-Young Chung,et al. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.
[2] Johannes B. Huber,et al. Upper bound on the minimum distance of turbo codes , 2001, IEEE Trans. Commun..
[3] Alain Glavieux,et al. Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .
[4] Joachim Hagenauer,et al. A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.
[5] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[6] Joseph J. Boutros,et al. Turbo code at 0.03 dB from capacity limit , 2002, Proceedings IEEE International Symposium on Information Theory,.
[7] G. David Forney,et al. Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.
[8] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[9] Jung-Fu Cheng,et al. Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..
[10] Peter Elias,et al. Error-free Coding , 1954, Trans. IRE Prof. Group Inf. Theory.
[11] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[12] Gérard Battail. Coding for the Gaussian channel - The promise of weighted-output decoding , 1989 .
[13] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.