Pseudo-codeword Landscape
暂无分享,去创建一个
[1] Ralf Koetter,et al. Towards Low-Complexity Linear-Programming Decoding , 2006, ArXiv.
[2] R. Koetter,et al. On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles , 2001 .
[3] Paul H. Siegel,et al. Adaptive Linear Programming Decoding , 2006, 2006 IEEE International Symposium on Information Theory.
[4] Michael Chertkov,et al. Loop Calculus Helps to Improve Belief Propagation and Linear Programming Decodings of Low-Density-Parity-Check Codes , 2006, ArXiv.
[5] Mihalis Yannakakis,et al. Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.
[6] Hans-Andrea Loeliger,et al. Codes and iterative decoding on general graphs , 1995, Eur. Trans. Telecommun..
[7] Bane V. Vasic,et al. Diagnosis of weaknesses in modern error correction codes: a physics approach , 2005, Physical review letters.
[8] David J. C. MacKay,et al. Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes , 2003, MFCSIT.
[9] A. M. Abdullah,et al. Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .
[10] P. Vontobel,et al. Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.
[11] Michael Chertkov,et al. An Efficient Pseudo-Codeword Search Algorithm for Linear Programming Decoding of LDPC Codes , 2006, ArXiv.
[12] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[13] G. A. Margulis,et al. Explicit constructions of graphs without short cycles and low density codes , 1982, Comb..
[14] William T. Freeman,et al. Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.
[15] Martin J. Wainwright,et al. Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.
[16] Hans-Andrea Loeliger,et al. Codes and iterative decoding on general graphs , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[17] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[18] R. M. Tanner,et al. A Class of Group-Structured LDPC Codes , 2001 .
[19] P. Vontobel,et al. Graph-covers and iterative decoding of nite length codes , 2003 .
[20] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[21] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[22] Michael Chertkov,et al. An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes , 2006, IEEE Transactions on Information Theory.
[23] Thomas J. Richardson,et al. Error Floors of LDPC Codes , 2003 .
[24] Michael Chertkov,et al. Instanton analysis of Low-Density Parity-Check codes in the error-floor regime , 2006, 2006 IEEE International Symposium on Information Theory.
[25] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[26] Erozan M. Kurtas. Advanced Error Control Techniques for Data Storage Systems , 2005 .