The geometry of turbo-decoding dynamics
暂无分享,去创建一个
[1] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[2] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[3] Stig K. Andersen,et al. Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .
[4] 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.
[5] Peter Adam Hoeher,et al. Separable MAP "filters" for the decoding of product and concatenated codes , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[6] Patrick Robertson,et al. Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.
[7] Sergio Benedetto,et al. Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.
[8] Emina Soljanin,et al. On the performance of recursive decoding schemes , 1997, Proceedings of IEEE International Symposium on Information Theory.