On the Complexity of Exact Maximum-Likelihood Decoding for Asymptotically Good Low Density Parity Check Codes: A New Perspective
暂无分享,去创建一个
[1] Yunghsiang Sam Han,et al. Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes , 1993, IEEE Trans. Inf. Theory.
[2] P. Vontobel,et al. Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.
[3] Saharon Shelah,et al. Expected Computation Time for Hamiltonian Path Problem , 1987, SIAM J. Comput..
[4] David Burshtein,et al. Expander graph arguments for message-passing algorithms , 2001, IEEE Trans. Inf. Theory.
[5] Martin J. Wainwright,et al. Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.
[6] Xiaofei Huang,et al. Near perfect decoding of LDPC codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[7] G. D. Forney,et al. Performance and complexity , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[8] Antoine Lobstein. The hardness of solving subset sum with preprocessing , 1990, IEEE Trans. Inf. Theory.
[9] Moni Naor,et al. The hardness of decoding linear codes with preprocessing , 1990, IEEE Trans. Inf. Theory.
[10] Alexander Vardy,et al. Algorithmic complexity in coding theory and the minimum distance problem , 1997, STOC '97.
[11] Frederick Jelinek. An upper bound on moments of sequential decoding effort , 1969, IEEE Trans. Inf. Theory.
[12] Madhu Sudan,et al. Maximum-likelihood decoding of Reed-Solomon codes is NP-hard , 1996, IEEE Transactions on Information Theory.
[13] Martin J. Wainwright,et al. LP Decoding Corrects a Constant Fraction of Errors , 2004, IEEE Transactions on Information Theory.
[14] Thomas J. Richardson,et al. Error Floors of LDPC Codes , 2003 .
[15] Marc P. C. Fossorier,et al. Iterative reliability-based decoding of low-density parity check codes , 2001, IEEE J. Sel. Areas Commun..
[16] Daniel A. Spielman,et al. Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[17] Eric Allender,et al. Complexity Theory , 1997, Encyclopedia of Cryptography and Security.
[18] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .
[19] Michael Krivelevich,et al. Solving random satisfiable 3CNF formulas in expected polynomial time , 2006, SODA '06.
[20] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.