Decay of correlations: An application to low-density parity check codes
暂无分享,去创建一个
[1] Nicolas Macris,et al. Proof of replica formulas in the high noise regime for communication using LDGM codes , 2008, 2008 IEEE Information Theory Workshop.
[2] Nicolas Macris,et al. Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel , 2007, 2007 IEEE International Symposium on Information Theory.
[3] Andrea Montanari,et al. Asymptotic Rate versus Design Rate , 2007, 2007 IEEE International Symposium on Information Theory.
[4] Nicolas Macris,et al. Sharp Bounds on Generalized EXIT Functions , 2007, IEEE Transactions on Information Theory.
[5] Nicolas Macris,et al. Griffith–Kelly–Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes , 2007, IEEE Transactions on Information Theory.
[6] Andrea Montanari,et al. Tight bounds for LDPC and LDGM codes under MAP decoding , 2004, IEEE Transactions on Information Theory.
[7] A. Rényi,et al. Probabilistic methods in group theory , 1965 .
[8] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[9] Nicolas Macris,et al. Sharp Bounds for MAP Decoding of General Irregular LDPC Codes , 2006, 2006 IEEE International Symposium on Information Theory.
[10] C. Méasson. Conservation laws for coding , 2006 .
[11] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[12] Andrea Montanari,et al. Maximum a posteriori decoding and turbo codes for general memoryless channels , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..