Information geometry for turbo decoding
暂无分享,去创建一个
[1] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[2] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.
[3] Shun-ichi Amari,et al. Methods of information geometry , 2000 .
[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] Shun-ichi Amari,et al. Differential-geometrical methods in statistics , 1985 .
[6] Shun-ichi Amari,et al. Information geometry of turbo codes , 2002, Proceedings IEEE International Symposium on Information Theory,.
[7] Jung-Fu Cheng,et al. Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..
[8] Thomas J. Richardson,et al. The geometry of turbo-decoding dynamics , 2000, IEEE Trans. Inf. Theory.
[9] Toshiyuki Tanaka,et al. Information Geometry of Mean-Field Approximation , 2000, Neural Computation.
[10] D. Saad,et al. The TAP Approach to Intensive and Extensive Connectivity Systems , 2001 .
[11] Hilbert J. Kappen,et al. Mean field theory for graphical models , 2001 .