Statistical mechanics of the data compression theorem
暂无分享,去创建一个
[1] R. Palmer,et al. Solution of 'Solvable model of a spin glass' , 1977 .
[2] Jack K. Wolf,et al. Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.
[3] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[4] D. Sherrington,et al. Graph bipartitioning and spin glasses on a random network of fixed finite valence , 1987 .
[5] Yoshiyuki Kabashima,et al. Belief propagation vs. TAP for decoding corrupted messages , 1998 .
[6] T. Richardson,et al. Design of provably good low-density parity check codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[7] Saad,et al. Statistical physics of regular low-density parity-check error-correcting codes , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[8] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[9] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[10] Nicolas Sourlas,et al. Spin-glass models as error-correcting codes , 1989, Nature.