Error-correcting codes that nearly saturate Shannon's bound
暂无分享,去创建一个
[1] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[2] Allen H. Levesque,et al. Error-control techniques for digital communication , 1985 .
[3] Kanter,et al. Mean-field theory of spin-glasses with finite coordination number. , 1987, Physical review letters.
[4] Kanter. Asymmetric neural networks with multispin interactions. , 1988, Physical review. A, General physics.
[5] Nicolas Sourlas,et al. Spin-glass models as error-correcting codes , 1989, Nature.
[6] Alain Glavieux,et al. Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .
[7] Brendan J. Frey,et al. Graphical Models for Machine Learning and Digital Communication , 1998 .
[8] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[9] D. Saad,et al. Statistical mechanics of error-correcting codes , 1999 .
[10] Claude E. Shannon,et al. A mathematical theory of communication , 1948, MOCO.