On the asymptotic weight distribution of regular LDPC ensembles
暂无分享,去创建一个
[1] Andrea Montanari,et al. Weight distributions of LDPC code ensembles: combinatorics meets statistical physics , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[2] David Burshtein,et al. Asymptotic enumeration methods for analyzing LDPC codes , 2004, IEEE Transactions on Information Theory.
[3] F. Guerra. Spin Glasses , 2005, cond-mat/0507581.
[4] Edward A. Bender,et al. Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions , 1983, J. Comb. Theory, Ser. A.
[5] Alexander Vardy,et al. The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.
[6] Michael Horstein,et al. Review of 'Low-Density Parity-Check Codes' (Gallager, R. G.; 1963) , 1964, IEEE Transactions on Information Theory.
[7] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[8] D. Saad,et al. Critical Noise Levels for LDPC decoding , 2002, cond-mat/0203159.
[9] R. Urbanke,et al. Weight Distribution of Iterative Coding Systems: How Deviant can You be? , 2001 .
[10] D Saad,et al. Critical noise levels for low-density parity check decoding. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[11] Nicolas Sourlas,et al. Spin-glass models as error-correcting codes , 1989, Nature.
[12] N. Sourlas. Spin Glasses, Error-Correcting Codes and Finite-Temperature Decoding , 1994 .
[13] Simon Litsyn,et al. On ensembles of low-density parity-check codes: Asymptotic distance distributions , 2002, IEEE Trans. Inf. Theory.
[14] A. Montanari. The glassy phase of Gallager codes , 2001, cond-mat/0104079.