D. Burshtein and A. Bennatan, Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels, IEEE Trans. Inform. Theory, vol.52, issue.2, pp.549-583, 2006.

N. Alon, S. Hoory, and N. Linial, The Moore Bound for Irregular Graphs, Graphs and Combinatorics, vol.18, issue.1, pp.53-57, 2002.
DOI : 10.1007/s003730200002

I. Andriyanova, J. P. Tillich, and J. C. Carlach, Asymptotically good codes with high iterative decoding performances, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., pp.850-854, 2005.
DOI : 10.1109/ISIT.2005.1523457
URL : https://hal.archives-ouvertes.fr/hal-00524604

I. Andriyanova, J. P. Tillich, and J. C. Carlach, A new family of asymptotically good codes with high iterative decoding performances, ICC'06, 2006.

M. Ardakani and F. R. Kschischang, A More Accurate One-Dimensional Analysis and Design of Irregular LDPC Codes, IEEE Transactions on Communications, vol.52, issue.12, pp.2106-2114, 2004.
DOI : 10.1109/TCOMM.2004.838718

A. Ashikhmin, G. Kramer, S. Ten, and . Brink, Extrinsic information transfer functions: model and erasure channel properties, IEEE Transactions on Information Theory, vol.50, issue.11, pp.502657-2673, 2004.
DOI : 10.1109/TIT.2004.836693

R. Koetter, B. Frey, and A. Vardy, Skewness and pseudocodewords in iterative decoding, ISIT 1998, 2006.

L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate (Corresp.), IEEE Transactions on Information Theory, vol.20, issue.2, pp.284-287, 1974.
DOI : 10.1109/TIT.1974.1055186

S. Benedetto and G. Montorsi, Unveiling turbo codes: some results on parallel concatenated coding schemes, IEEE Transactions on Information Theory, vol.42, issue.2, pp.409-429, 1996.
DOI : 10.1109/18.485713

C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding, ICC'93, pp.1064-1070, 1993.

C. Berrou and M. Jézéquel, Non binary convolutional codes for turbo-coding. Electronic Letters, pp.39-40, 1999.

C. Berrou, M. Jézéquel, C. Douillard, and S. Kerouédan, The advantages of nonbinary turbo-codes, Information Theory Workshop ITW'01, pp.61-63, 2001.

K. Bhattad and K. R. Narayanan, An MSE based transfer chart to analyze iterative decoding schemes, 2005.

J. Boutros, G. Caire, E. Viterbo, H. Sawaya, and S. Vialle, Turbo code at 0.03 dB from capacity limit, Proceedings IEEE International Symposium on Information Theory,, p.56, 2002.
DOI : 10.1109/ISIT.2002.1023328

J. Boutros, O. Pothier, and G. Zémor, Generalized low density (Tanner) codes, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311), pp.441-445, 1999.
DOI : 10.1109/ICC.1999.767979

M. Breiling, A Logarithmic Upper Bound on the Minimum Distance of Turbo Codes, IEEE Transactions on Information Theory, vol.50, issue.8, pp.1692-1710, 2004.
DOI : 10.1109/TIT.2004.831763

D. Burshtein and G. Miller, Asymptotic Enumeration Methods for Analyzing LDPC Codes, IEEE Transactions on Information Theory, vol.50, issue.6, pp.1115-1131, 2004.
DOI : 10.1109/TIT.2004.828064

A. Montanari, C. Measson, and R. Urbanke, Maxwell construction: the hidden bridge between iterative and maximum a posteriori decoding, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00290624

T. Richardson, C. Measson, A. Montanari, and R. Urbanke, Life above threshold: from list decoding to area theorem and MSE, IEEE Information Theory Workshop, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00290622

C. Chaikalis and J. M. Noras, Reconfigurable turbo decoding for 3G applications, Signal Processing, vol.84, issue.10, pp.1957-1972, 2004.
DOI : 10.1016/j.sigpro.2004.07.005

S. Y. Chung, G. D. Forney-jr, T. Richardson, and R. Urbanke, On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit, IEEE Communications Letters, vol.5, issue.2, pp.58-60, 2001.
DOI : 10.1109/4234.905935

C. Cole and E. Hall, Analysis and Design of Moderate Length Regular LDPC Codes with Low Error Floors, 2006 40th Annual Conference on Information Sciences and Systems, 2006.
DOI : 10.1109/CISS.2006.286581

T. M. Cover and J. M. Thomas, Elements of information theory, 1991.

S. Dolinar, D. Divsalar, and C. Jones, Construction of protograph LDPC codes with linear minimum distance, 2006.

M. C. Davey and D. J. Mackay, Low-density parity check codes over GF(q), IEEE Communications Letters, vol.2, issue.6, pp.165-167, 1998.
DOI : 10.1109/4234.681360

A. Dembo and O. Zeitouni, Large deviations techniques and applications. Applications of Mathematics, Stochastic modelling and applied probability, 1998.

C. Di, D. Proietti, I. Telatar, T. Richardson, and R. Urbanke, Finite length analysis of low-density parity-chack codes on the binary erasure channel, IEEE Trans. Inform. Theory, issue.6, pp.481570-1579, 2002.

C. Di, T. Richardson, and R. Urbanke, Weight distributions : how deviant can you be?, Proceedings of the IEEE Int. Symp. Inform. Theory, p.50, 2001.

C. Di, T. Richardson, and R. Urbanke, Weight distribution of low-density paritycheck codes. preprint, 2004.

D. Divsalar, H. Jin, and R. J. Mceliece, Coding theorems for 'turbo-like' codes, Proc. 36th Allerton Conf. on Coomunication, Control, and Computing, pp.201-210, 1998.

T. Lehnigk-emden, F. Kienle, and N. Wehn, Fast convergence algorithm for LDPC codes, VTC 2006-Spring, pp.2393-2397, 2006.

B. J. Frey, F. R. Kschischang, and H. A. Loeliger, Factor graphs and the sum-product algorithm, IEEE Trans. on Inform. Theory, vol.47, issue.2, pp.498-519, 2001.

J. Frey and J. C. Mackay, Irregular turbo-codes, Proceedings of the 37th annual Allerton conference on Communications, Control and Computing, 1999.

F. R. Gantmacher, The theory of matrices, 1959.

R. G. Gallager, Low Density Parity Check Codes. M.I, 1963.

H. Gamal and A. R. Hammons, Analyzing the turbo decoder using the Gaussian approximation, IEEE Transactions on Information Theory, vol.47, issue.2, pp.671-686, 2001.
DOI : 10.1109/18.910581

C. H. Hsu and A. Anastasopoulos, Asymptotic weight distributions of irregular repeat-accumulate codes, IEEE Global Telecommunications Conference, vol.3, pp.1147-1151, 2005.

X. Hu, Low-delay low-complexity error-correcting codes on sparse graphs, 2002.

X. Hu, E. Eleftheriou, and D. M. Arnold, Regular and irregular progressive edge-growth tanner graphs, IEEE Transactions on Information Theory, vol.51, issue.1, pp.386-398, 2005.
DOI : 10.1109/TIT.2004.839541

E. Telatar, I. Sason, and R. Urbanke, On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders, IEEE Trans. Inform. Theory, vol.48, pp.3052-3061, 2002.

H. Jin, A. Khandekar, and R. Mceliece, Irregular repeat-accumulate codes, Proceedings of the 2nd Int. Conf. on Turbo codes and related topics, pp.1-8, 2000.

J. Pearl, Probabilistic reasoning in intelligent systems: networks of Plausible Inference, 1988.

J. W. Lee and R. E. Blahut, Bit error rate estimate of finite length turbo codes, ICC 2003 -IEEE International Conference on Communications, pp.2728-2732, 2003.

W. K. , R. Leung, G. Yue, L. Ping, and X. Wang, Concatenated zigzag Hadamard codes, IEEE Trans. Inform. Theory, vol.52, issue.4, pp.1711-1723, 2006.

S. Litsyn and V. Shevelev, On ensembles of low-density parity-check codes: asymptotic distance distributions, IEEE Transactions on Information Theory, vol.48, issue.4, pp.887-908, 2002.
DOI : 10.1109/18.992777

M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, Practical loss resilent codes, Proceedings of the 30th annual ACM Symposium on Theory of Computing (STOC), pp.249-258, 1998.

M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, Efficient erasure correcting codes, IEEE Transactions on Information Theory, vol.47, issue.2, pp.569-584, 2001.
DOI : 10.1109/18.910575

M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, Improved low-density parity-check codes using irregular graphs, IEEE Transactions on Information Theory, vol.47, issue.2, pp.585-598, 2001.
DOI : 10.1109/18.910576

D. Mackay and M. Davey, Evaluation of Gallager Codes for Short Block Length and High Rate Applications, IMA Volumes in Mathematics and its Applications, 2000.
DOI : 10.1007/978-1-4613-0165-3_6

D. Mackay and M. Postol, Weaknesses of Margulis and Ramanujan-Margulis lowdensity parity-check codes, In Electronic Notes in Theoretical Computer science, vol.74, 2003.

E. Milenkovic, P. Soljanin, and . Whiting, Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles, IEEE Transactions on Information Theory, vol.53, issue.1
DOI : 10.1109/TIT.2006.887060

H. Pishro-nik and F. Fekri, Performance of low-density parity-check codes with linear minimum distance, IEEE Transactions on Information Theory, vol.52, issue.1, pp.292-300, 2006.
DOI : 10.1109/TIT.2005.860439

O. Pothier, Compound codes based on graphs and their iterative decoding, 2000.

V. Rathi and R. Urbanke, Density evolution, thresholds and the stability condition for non-binary LDPC codes, IEE Proceedings - Communications, vol.152, issue.6, 2005.
DOI : 10.1049/ip-com:20050230

T. Richardson, Error-floors of LDPC codes, Proceedings of the 41st Annual Conference on Communications, pp.1426-1435, 2003.

T. Richardson, A. Shokrollahi, and R. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, IEEE Transactions on Information Theory, vol.47, issue.2, pp.619-637, 2001.
DOI : 10.1109/18.910578

T. Richardson and R. Urbanke, Modern coding theory. In preparation. see http

T. Richardson and R. Urbanke, Multi-edge LDPC codes Available at

T. Richardson and R. Urbanke, The capacity of low-density parity-check codes under message-passing decoding, IEEE Transactions on Information Theory, vol.47, issue.2, pp.599-618, 2001.
DOI : 10.1109/18.910577

G. Montorsi, S. Benedetto, D. Divsalar, and F. Pollara, Serial concatenation of interleaved codes: performance analysis, design and iterative decoding, IEEE Trans. on Information Theory, vol.44, pp.909-926, 1998.

H. E. Sawaya and J. Boutros, Irregular turbo-codes with symbol-based iterative decoding, 3 rd International Symposium on Turbo-codes, pp.407-410, 2003.

R. Sedgewick and P. Flajolet, IntroductionàIntroduction`Introductionà l'analyse des algorithmes, 1996.

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423623, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

A. Shokrollahi, Capacity-Achieving Sequences, Codes,Systems, and Graphical Models, number 123 in IMA Mathematics and Applications, pp.153-166, 2000.
DOI : 10.1007/978-1-4613-0165-3_9

G. W. Stewart and J. G. Sun, Matrix perturbation Theory. Computer science and scientific computing, 1990.

R. M. Tanner, A recursive approach to low complexity codes, IEEE Transactions on Information Theory, vol.27, issue.5, pp.533-547, 1981.
DOI : 10.1109/TIT.1981.1056404

S. Brink, Convergence behavior of iteratively decoded parallel concatenated codes, IEEE Transactions on Communications, vol.49, issue.10, pp.1727-1737, 2001.
DOI : 10.1109/26.957394

S. Ten-brink, G. Kramer, and A. Ashikhmin, Design of Low-Density Parity-Check Codes for Modulation and Detection, IEEE Transactions on Communications, vol.52, issue.4, pp.670-678, 2004.
DOI : 10.1109/TCOMM.2004.826370

J. Thorpe, Low-density parity-check (LDPC) codes constructed from protographs, 2003.

J. P. Tillich, The average weight distribution of tanner code ensembles and a way to modify them to improve their weight distribution, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., p.7, 2004.
DOI : 10.1109/ISIT.2004.1365045

J. Tillich, HabilitationàHabilitation`Habilitationà Diriger des Recherches, 2006.

J. P. Tillich and G. Zémor, On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation, 2006 IEEE International Symposium on Information Theory, 2006.
DOI : 10.1109/ISIT.2006.262128

R. Urbanke and V. Rathi, Density evolution, thresholds and the stability condition for non-binary LDPC codes, IEEE Trans. on Communications, 2005.

Y. Wang, R. Ramesh, A. Hassan, and H. Koorapaty, On MAP decoding for tail-biting convolutional codes, Proceedings of ISIT'97, 1997.

N. Wiberg, Codes and Decoding on General Graphs, 1996.

E. Eleftheriou and X. Hu, Binary representation of cycle Tanner-graph GF(2 b ) codes, ICC'04, 2004.

K. Yang, A nonbinary extension of RA codes: weighted nonbinary repeat accumulate codes, 14th IEEE 2003 International Symposium on Personal, Indoor and Mobile Radio Communication Proceedings, 2003.