R. G. Gallager, Low-density parity-check codes, IEEE Transactions on Information Theory, vol.8, issue.1, 1963.
DOI : 10.1109/TIT.1962.1057683

T. Richardson, Eror floors of LDPC codes, Allerton Conference, 2001.

V. Chernyak, M. Chertkov, M. G. Stepanov, and B. Vasic, Error Correction on a Tree: An Instanton Approach, Physical Review Letters, vol.93, issue.19, p.93, 2004.
DOI : 10.1103/PhysRevLett.93.198702

M. G. Stepanov, V. Chernyak, M. Chertkov, and B. Vasic, Diagnosis of Weaknesses in Modern Error Correction Codes: A Physics Approach, Physical Review Letters, vol.95, issue.22, p.95, 2005.
DOI : 10.1103/PhysRevLett.95.228701

M. G. Stepanov and M. Chertkov, Instanton analysis of Low-Density Parity-Check codes in the error-floor regime, 2006 IEEE International Symposium on Information Theory, 2006.
DOI : 10.1109/ISIT.2006.261777

M. Chertkov and M. Stepanov, Pseudo-codeword landscape, IEEE Intern. Symp. on Inform. Theory, 2007.

M. Chertkov and M. G. Stepanov, An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes, IEEE Transactions on Information Theory, vol.54, issue.4, pp.1514-1520, 2008.
DOI : 10.1109/TIT.2008.917682

J. Feldman, M. Wainright, and D. R. Karger, Using Linear Programming to Decode Binary Linear Codes, Conference on Information Sciences and Systems, 2003.
DOI : 10.1109/TIT.2004.842696
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.6585

D. J. Mackay, Good error-correcting codes based on very sparse matrices, IEEE Transactions on Information Theory, vol.45, issue.2, pp.399-431, 1999.
DOI : 10.1109/18.748992

P. O. Vontobel and R. Koetter, On the relationship between LP decoding and Min-Sum Algorithms decoding, ISITA, 2004.

R. Smarandache, A. Pusane, P. O. Vontobel, J. D. Costello-]-n, D. Axvig et al., Pseudo-codewords in LDPC convolutional codes A universal theory of decoding and pseudocodewords, IEEE Intern. Symp. on Inform. Theory Allerton Conference on Communication, Control, and Computing, 2006.

C. Kelley and D. Sridhara, Pseudocodewords of Tanner Graphs, IEEE Transactions on Information Theory, vol.53, issue.11, pp.4013-4038, 2007.
DOI : 10.1109/TIT.2007.907501

R. Koetter and P. O. Vontobel, Graph covers and iterative decoding of finite-length codes, 3rd Intl. Symp. on Turbo Codes and Realted Topics, pp.75-82, 2003.

J. S. Yedidia, W. T. Freeman, and Y. Weiss, Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms, IEEE Transactions on Information Theory, vol.51, issue.7, p.51, 2005.
DOI : 10.1109/TIT.2005.850085
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.9766

S. Reynal and H. T. Diep, Fast flat histogram algorithm for generalized spin models, Phys. Rev., E, vol.72, issue.56710, 2005.
DOI : 10.1103/physreve.72.056710
URL : http://arxiv.org/abs/cond-mat/0504367

S. Kakakhail, S. Reynal, D. Declercq, and V. Y. Heinrich, Fast Simulation for the Performance Evaluation of LDPC Codes using Fast Flat Histogram Method, 2008 IEEE Sarnoff Symposium, 2008.
DOI : 10.1109/SARNOF.2008.4520050
URL : https://hal.archives-ouvertes.fr/hal-00512276

S. Kakakhail, S. Reynal, D. Declercq, and V. Y. Heinrich, Efficient performance evaluation of Forward Error Correcting codes, 2008 11th IEEE Singapore International Conference on Communication Systems, 2008.
DOI : 10.1109/ICCS.2008.4737185
URL : https://hal.archives-ouvertes.fr/hal-00512279

. G. Jr, R. Forney, F. R. Koetter, A. Kschischang, and . Reznik, On the effective weights of pseudocodewords for codes defined on graphs with cycles " . Codes, Systems and graphical models, IMA Appl, vol.123, pp.101-112, 1999.

N. Wiberg, Codes and decoding on general graphs, 1996.
DOI : 10.1109/isit.1995.550455

N. Wiberg, H. Loeliger, and R. Koetter, Codes and iterative decoding on general graphs, Europ. Trans. Telecommunications, vol.6, issue.513, 1995.
DOI : 10.1109/isit.1995.550455

R. Holzlohner, A. Mahadevan, C. Menyuk, J. Morris, and J. Zweck, Evaluation of the very low BER of FEC codes using dual adaptive importance sampling, IEEE Communications Letters, vol.9, issue.2, 2005.
DOI : 10.1109/LCOMM.2005.02012

W. Krauth, Introduction to Monte Carlo Algorithms Advances in computer simulation, lectures held at Eotvos summer school in Budapest, 1996.

N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. M. Teller, and E. Teller, Equation of State Calculations by Fast Computing Machines, The Journal of Chemical Physics, vol.21, issue.6, pp.1087-1092, 1953.
DOI : 10.1063/1.1699114

G. O. Roberts, A. Gelman, and W. R. Gilks, Weak convergence and optimal scaling of random walk Metropolis algorithms, The Annals of Applied Probability, vol.7, issue.1
DOI : 10.1214/aoap/1034625254

F. Wang and D. P. Landau, Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogram, Physical Review E, vol.64, issue.5, 2001.
DOI : 10.1103/PhysRevE.64.056101

F. Wang and D. P. Landau, Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States, Physical Review Letters, vol.86, issue.10, 2001.
DOI : 10.1103/PhysRevLett.86.2050

R. M. Tanner, D. Sridhara, and T. Fuja, A class of group-structured LDPC codes, 2001.

G. A. Margulis, Explicit constructions of graphs without short cycles and low density codes, Combinatorica, vol.12, issue.1, 1982.
DOI : 10.1007/BF02579283

]. D. Mackay and /. En-/-c, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications -Enhancements for Higher Throughput (Draft) Encyclopedia of sparse graph codes, IEEE P802.11n/D1.05, 2006.

D. Declercq and M. Fossorier, Improved iImpulse method to evaluate the low weight profile of sparse binary linear codes, IEEE Intern. Symp. on Inform. Theory, 2008.