An efficient pseudo-codeword search algorithm for Belief Propagation decoding of LDPC codes
暂无分享,去创建一个
David Declercq | Sylvain Reynal | Shahkar Kakakhail | Vincent Heinrich | D. Declercq | S. Reynal | V. Heinrich | S. Kakakhail
[1] János Kertész,et al. Advances in computer simulation : lectures held at the Eötvös Summer School in Budapest, Hungary, 16-20, July 1996 , 1998 .
[2] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.
[3] A. B. Bortz,et al. A new algorithm for Monte Carlo simulation of Ising spin systems , 1975 .
[4] A. Gelman,et al. Weak convergence and optimal scaling of random walk Metropolis algorithms , 1997 .
[5] D. Landau,et al. Determining the density of states for classical statistical models: a random walk algorithm to produce a flat histogram. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[6] Ali Emre Pusane,et al. Pseudo-Codewords in LDPC Convolutional Codes , 2006, 2006 IEEE International Symposium on Information Theory.
[7] P. Vontobel,et al. On the Relationship between Linear Programming Decoding and Min-Sum Algorithm Decoding , 2004 .
[8] M. Wainwright,et al. Using Linear Programming to Decode Linear Codes , 2003 .
[9] 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.
[10] D. Declercq,et al. Fast Simulation for the Performance Evaluation of LDPC Codes using Fast Flat Histogram Method , 2008, 2008 IEEE Sarnoff Symposium.
[11] Werner Krauth,et al. Introduction To Monte Carlo Algorithms , 1996, cond-mat/9612186.
[12] R. Koetter,et al. On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles , 2001 .
[13] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[14] Ronald Holzlöhner,et al. Evaluation of the very low BER of FEC codes using dual adaptive importance sampling , 2005, IEEE Communications Letters.
[15] Deepak Sridhara,et al. Pseudocodewords of Tanner Graphs , 2005, IEEE Transactions on Information Theory.
[16] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[17] Michael Chertkov,et al. An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes , 2006, IEEE Transactions on Information Theory.
[18] Michael Chertkov,et al. Pseudo-codeword Landscape , 2007, 2007 IEEE International Symposium on Information Theory.
[19] V Chernyak,et al. Error correction on a tree: an instanton approach. , 2004, Physical review letters.
[20] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[21] G. A. Margulis,et al. Explicit constructions of graphs without short cycles and low density codes , 1982, Comb..
[22] Bane V. Vasic,et al. Diagnosis of weaknesses in modern error correction codes: a physics approach , 2005, Physical review letters.
[23] Judy L. Walker,et al. A Universal Theory of Decoding and Pseudocodewords , 2008 .
[24] Michael Chertkov,et al. An Efficient Pseudo-Codeword Search Algorithm for Linear Programming Decoding of LDPC Codes , 2006, ArXiv.
[25] D. Landau,et al. Efficient, multiple-range random walk algorithm to calculate the density of states. , 2000, Physical review letters.
[26] Christoph Dellago,et al. Wang-Landau sampling with self-adaptive range. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[27] William T. Freeman,et al. Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.
[28] Martin J. Wainwright,et al. Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.
[29] R. M. Tanner,et al. A Class of Group-Structured LDPC Codes , 2001 .
[30] P. Vontobel,et al. Graph-covers and iterative decoding of nite length codes , 2003 .
[31] Thomas J. Richardson,et al. Error Floors of LDPC Codes , 2003 .
[32] David Declercq,et al. Improved impulse method to evaluate the low weight profile of sparse binary linear codes , 2008, 2008 IEEE International Symposium on Information Theory.
[33] H. Diep,et al. Fast flat-histogram method for generalized spin models. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[34] Hans-Andrea Loeliger,et al. Codes and iterative decoding on general graphs , 1995, Eur. Trans. Telecommun..
[35] D. Declercq,et al. Efficient performance evaluation of Forward Error Correcting codes , 2008, 2008 11th IEEE Singapore International Conference on Communication Systems.
[36] David J. C. MacKay,et al. Encyclopedia of Sparse Graph Codes , 1999 .
[37] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .