On the complexity of exact maximum-likelihood decoding for asymptotically good low density parity check codes: A new perspective

2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Volumn , Issue , 2007, Pages 150-155

  Xu, Weiyu ^a   Hassibi, Babak ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(ALGORITHMIC) COMPLEXITY; (E ,2E) THEORY; (E ,3E) PROCESS; ADDITIVE WHITE GAUSSIAN NOISE (AWGN) CHANNELS; AVERAGE-CASE; BELIEF PROPAGATION (BP) DECODING; BINARY SYMMETRIC CHANNELS (BDC); BIT FLIPPING (BF); DECODING ALGORITHMS; ERROR FLOOR; ERROR PROBABILITIES; EXPANDER CODES; GENERAL (CO); GOOD CODES; HIGH SNR; IN CHANNELS; LINEAR CODING; LOW DENSITY PARITY-CHECK (LDPC) CODES; MAXIMUM LIKELIHOOD (ML) DECODING; MAXIMUM LIKELIHOOD (MLET); NP-HARD; POLYNOMIAL COMPLEXITY; PUNCTURED LOW DENSITY PARITY CHECK (LDPC) CODES; SHANNON CHANNEL CAPACITY;

ADAPTIVE ALGORITHMS; ADMINISTRATIVE DATA PROCESSING; ASYMPTOTIC ANALYSIS; BIT ERROR RATE; CHANNEL CAPACITY; CHANNEL CODING; CODES (STANDARDS); CODES (SYMBOLS); COMMUNICATION; COMMUNICATION SYSTEMS; CYBERNETICS; FINANCIAL DATA PROCESSING; INFORMATION THEORY; MAXIMUM LIKELIHOOD; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROBABILITY; PROGRAMMING THEORY; SATELLITE COMMUNICATION SYSTEMS;

DECODING;

EID: 46749145792     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2007.4313065     Document Type: Conference Paper

References (19)

1. E.R. Berlekamp, R.J.McEliece, and H.C.A. Van Tilborg, "On the inherent intractability of certain coding problems," IEEE Transactions on Information Theory, vol. 24, issue. 5, pp. 384-386, May 1978;
2. V.Guruswami,A.Vardy, "Maximum-likelihood decoding of Reed-Solomon codes is NP-hard," IEEE Transactions on Information Theory, vol. 51, issue. 7, pp. 2249-2256, 2005;
3. J.D. Forney, "Performance and Complexity," Proceedings of IEEE International Symposium on Information Theory,1995. pp. 17-22, 1995;
4. F. Jelinek, "An Upper Bound on Moments of Sequential Decoding Effort." IEEE Transactions on Information Theory, vol. 15, pp. 140-149, 1969;
5. Y.S.Han,C.R.P. Hartmann, Chih-Chieh Chen,"Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes," IEEE Transactions on Information Theory, vol. 39, vol. 39,pp. 1514 -1523, 1993;
6. J. Bruck and M. Naor, "The hardness of decoding linear codes with preprocessing," IEEE Transactions on Information Theory, vol. 36, pp. 381-385, March 1990;
7. M. Krivelevich and D. Vilenchik, "Solving random satisfiable 3CNF formulas in expected polynomial time," Proceedings of the 17th Symposium on Discrete Algorithms, pp. 454-463, 2006;
8. T.Richardson, "Error Floors of LDPC codes", in Proceedings of 41st Allerton Conference on Communications.Computing and Control,2003;
9. X. Huang,"Near perfect decoding of LDPC codes," in Proceedings of International Symposium on Information Theory 2005, pp.302-306, 2005;
10. Marc P.C. Fossorier,"Iterative Reliability-Based Decoding of Low-Density Parity Check Codes," in IEEE Journal on Selected Areas in Communications, vol. 19,pp.908-917 May 2001.
11. Weiyu Xu,"Efficient ML decoding of LDPC codes," in preparation;
12. Pascal O. Vontobel and Ralf Koetter,"Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes," submitted to IEEE Transactions on Information Theory;
13. Jon Feldman, Martin Wainwright and D. R. Karger, "Using linear programming to Decode Binary linear codes,"IEEE Transactions on Information Theory, vol. 51, pp. 954-972, 2005;
14. Michael Sipser and Daniel A.Spielman, "Expander Codes", IEEE Transactions on Information Theory, Vol 42, No 6, pp. 1710-1722, 1996;
15. Jon Feldman, Tal Malkin, Cliff Stein, Rocco A. Servedio, Martin J. Wainwright,"LP Decoding Corrects a Constant Fraction of Errors", IEEE Transactions on Information Theory,vol.53,No.1,pp.82-89, 2007;
16. D.Burshtein and G.Miller. "Expander Graph arguments for message-passing algorithms", IEEE Transaction on Theory, 782-790,February 2002.
17. C.Papadimitrou, Computational Complexity,Addison Wesley, 1994
18. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition, pp.651-664, MIT Press and McGraw-Hill, 2001.
19. Ingo Wegener, Complexity Theory, Springer, Heidelberg, 2005.