G. Liva, W. Ryan, and M. Chiani, Design of quasi-cyclic Tanner codes with low error floors, Proceedings of IEEE International Symposium on Turbo Codes, 2006.

L. Ping, W. Leung, and K. Wu, Low-rate turbo-Hadamard codes, IEEE Transactions on Information Theory, vol.49, issue.12, pp.3213-3224, 2003.
DOI : 10.1109/TIT.2003.820018

G. Yue, W. Leung, L. Ping, and X. Wang, Low Rate Concatenated Zigzag-Hadamard Codes, 2006 IEEE International Conference on Communications, 2006.
DOI : 10.1109/ICC.2006.254909

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.6109

N. Shimanuki, B. Kurkoski, K. Yamagichi, and K. Kobayashi, Improvements and extensions of low-rate Turbo-Hadamard codes, Proceedings of ISITA, 2006.

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

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

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

Y. Kou, S. Lin, and M. Fossorier, Low-density parity-check codes based on finite geometries: a rediscovery and new results, IEEE Transactions on Information Theory, vol.47, issue.7, 2001.
DOI : 10.1109/18.959255

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

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. J. Richardson and R. L. 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

C. Berrou and A. Glavieux, Near optimum error correcting coding and decoding: turbo-codes, IEEE Transactions on Communications, vol.44, issue.10, pp.1261-1271, 1996.
DOI : 10.1109/26.539767

J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference, 1988.

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. Y. Chung, G. D. Forney, T. J. 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

K. Price and R. Storn, Differential evolution -a simple and efficient heuristic for global optimization over continuous spaces, Journal on Global Optimization, vol.11, pp.341-359, 1997.

P. Oswald and M. A. Shokrollahi, Capacity-achieving sequences for the erasure channel, IEEE Transactions on Information Theory, vol.48, pp.364-373, 2002.
DOI : 10.1109/isit.2001.935911

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.6722

T. Etzion, A. Trachtenberg, and A. Vardy, Which codes have cycle-free Tanner graphs?, IEEE Transactions on Information Theory, vol.45, issue.6, pp.2173-2181, 1999.
DOI : 10.1109/18.782170

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.3455

P. O. Vontobel and R. Koetter, Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes, 2007.

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

M. Chiani and A. Ventura, Design and performance evaluation of some high-rate irregular low-density parity-check codes, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2001.
DOI : 10.1109/GLOCOM.2001.965566

C. Di, R. Urbanke, and T. Richardson, Weight Distribution of Low-Density Parity-Check Codes, IEEE Transactions on Information Theory, vol.52, issue.11, pp.4839-4855, 2006.
DOI : 10.1109/TIT.2006.883541

X. Hu, E. Eleftheriou, and D. 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

M. P. Fossorier, Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices, IEEE Transactions on Information Theory, vol.50, issue.8, pp.1788-1793, 2004.
DOI : 10.1109/TIT.2004.831841

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.7109

H. Jin, A. Khandekar, and R. Mceliece, Irregular repeat-accumulate codes, Proceedings of Int. Symp. on Turbo codes and Related Topics, 2000.

D. Divsalar, C. Jones, S. Dolinar, and J. Thorpe, Protograph based LDPC codes with minimum distance linearly growing with block size, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005., 2005.
DOI : 10.1109/GLOCOM.2005.1577834

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.464.3456

T. Richardson and R. Urbanke, Multi-edge type LDPC codes, 2004.

J. Boutros, O. Pothier, and G. Zemor, Generalized low density (Tanner) codes, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311), 1999.
DOI : 10.1109/ICC.1999.767979

E. Paolini, M. Fossorier, and M. Chiani, Analysis of doubly-generalized LDPC codes with random component codes for the binary erasure channel, Proceedings of Allerton Conference on Communications, Control and Computing, 2006.

I. Andriyanova, Analysis and design of a certain family of graph-based codes: TLDPC, Ecole Nationale Supérieure des Télécommunications, 2006.

M. Davey and D. 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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.5145

M. Davey, Error-correction using low density parity check codes, 1999.

X. Hu and E. Eleftheriou, Binary representation of cycle Tanner-graph GF(2/sup b/) codes, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), pp.528-532, 2004.
DOI : 10.1109/ICC.2004.1312545

C. Poulliat, M. Fossorier, and D. Declercq, Design of regular (2,dc)-LDPC codes over GF(q) using their binary images, IEEE Transactions on Communications, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00781944

T. J. Richardson, Error floors of LDPC codes, Proceedings of 41st Annual Allerton Conf. on Communications, Control and Computing, pp.1426-1435, 2003.

J. G. Proakis, Digital communications, 2001.

F. Macwilliams and N. Sloane, The theory of error-correcting codes, 1978.

B. Masnick and J. Wolf, On linear unequal error protection codes, IEEE Transactions on Information Theory, vol.13, issue.4, pp.600-607, 1967.
DOI : 10.1109/TIT.1967.1054054

S. Lin and D. J. Costello, Error-control coding, 1983.

I. S. Reed and G. Solomon, Polynomial Codes Over Certain Finite Fields, Journal of the Society for Industrial and Applied Mathematics, vol.8, issue.2, pp.300-304, 1960.
DOI : 10.1137/0108018

A. J. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Transactions on Information Theory, vol.13, issue.2, pp.260-269, 1967.
DOI : 10.1109/TIT.1967.1054010

F. Kschischang, B. Frey, and H. A. Loeliger, Factor graphs and the sum-product algorithm, IEEE Transactions on Information Theory, vol.47, issue.2, pp.498-519, 2001.
DOI : 10.1109/18.910572

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

D. J. Mackay and R. Neal, Near Shannon limit performance of low density parity check codes, Electronics Letters, vol.33, issue.6, pp.457-458, 1997.
DOI : 10.1049/el:19970362

A. Goupil, M. Colas, G. Gelle, and D. Declercq, FFT-Based BP Decoding of General LDPC Codes Over Abelian Groups, IEEE Transactions on Communications, vol.55, issue.4, pp.644-649, 2007.
DOI : 10.1109/TCOMM.2007.894089

A. Voicila, D. Declercq, F. Verdier, M. Fossorier, and P. Urard, Low-Complexity, Low-Memory EMS Algorithm for Non-Binary LDPC Codes, 2007 IEEE International Conference on Communications, 2007.
DOI : 10.1109/ICC.2007.115

URL : https://hal.archives-ouvertes.fr/hal-00524698

J. Chen, A. Dholakia, E. Eleftheriou, M. Fossorier, and X. Hu, Reduced-Complexity Decoding of LDPC Codes, IEEE Transactions on Communications, vol.53, issue.8, pp.1288-1299, 2005.
DOI : 10.1109/TCOMM.2005.852852

A. Bennatan and D. Burshtein, Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels, IEEE Transactions on Information Theory, vol.52, issue.2, pp.549-583, 2006.
DOI : 10.1109/TIT.2005.862080

G. Li, I. Fair, and W. Krzymien, Analysis of nonbinary LDPC codes using Gaussian approximation, Proceedings of IEEE International Symposium on Information Theory, 2003.

S. Chung, T. Richardson, and R. Urbanke, Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation, IEEE Transactions on Information Theory, vol.47, issue.2, pp.657-670, 2001.
DOI : 10.1109/18.910580

A. Venkiah, D. Declercq, and C. Poulliat, Design of cages with a randomized progressive edge-growth algorithm, IEEE Communications Letters, vol.12, issue.4, pp.301-303, 2008.
DOI : 10.1109/LCOMM.2008.071843

URL : https://hal.archives-ouvertes.fr/hal-00521059

]. K. Kasai, T. Shibuya, and K. Sakaniwa, Detailedly represented irregular LDPC codes, IEICE Transactions on Fundamentals, issue.10, pp.2435-2443, 2003.

G. Liva, S. Song, L. Lan, Y. Zhang, S. Lin et al., Design of LDPC Codes: A Survey and New Results, Journal on Communication Software and Systems, 2006.
DOI : 10.24138/jcomss.v2i3.283

D. Sridhara and T. Fuja, Low density parity check codes over groups and rings, Proceedings of the IEEE Information Theory Workshop, 2002.
DOI : 10.1109/ITW.2002.1115443

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.7591

J. Boutros, A. Ghaith, and Y. Yuan-wu, Non-binary adaptive LDPC codes for frequency selective channels: code construction and iterative decoding, 2006 IEEE Information Theory Workshop, ITW '06 Chengdu, 2006.
DOI : 10.1109/ITW2.2006.323784

E. Paolini, Iterative decoding methods based on low-density graphs, 2007.

C. Poulliat, M. Fossorier, and D. Declercq, Design of non binary LDPC codes using their binary image: algebraic properties, 2006 IEEE International Symposium on Information Theory, 2006.
DOI : 10.1109/ISIT.2006.261681

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

A. G. Kolpakov, The solution of the convex combination problem, Journal on Computational mathematics and mathematical physics, vol.32, issue.8, pp.1183-1188, 1992.

W. Press, S. Teukolsky, W. Vetterling, and B. Flannery, Numerical recipes in C, 1992.

S. Brink, Code doping for triggering iterative decoding convergence, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2001.
DOI : 10.1109/ISIT.2001.936098

A. Brouwer and T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Transactions on Information Theory, vol.39, issue.2, pp.662-677, 1993.
DOI : 10.1109/18.212301

D. Declercq and M. Fossorier, Decoding Algorithms for Nonbinary LDPC Codes Over GF<formula formulatype="inline"><tex>$(q)$</tex></formula>, IEEE Transactions on Communications, vol.55, issue.4, pp.633-643, 2007.
DOI : 10.1109/TCOMM.2007.894088

A. Viterbi, Very Low Rate Convolutional Codes for Maximum Theoretical Performance of Spread-Spectrum Multiple-Access Channels, IEEE Journal on Selected Areas on Communications, vol.8, pp.641-649, 1990.
DOI : 10.1142/9789814287517_0012

M. González-lópez, F. J. Vázquez-araújo, L. Castedo, and J. Garcia-frias, Layered LDGM codes: a capacity-approaching structure for arbitrary rates, 2007 4th International Symposium on Wireless Communication Systems, 2007.
DOI : 10.1109/ISWCS.2007.4392293

X. Hu and M. Fossorier, On the computation of the minimum distance of lowdensity patity-check codes, Proceedings of IEEE International Conference on Communications, 2004.

T. Richardson, in review of this paper, 2008.

G. Yue, L. Ping, and X. Wang, Low-rate generalized LDPC codes with Hadamard constraints, Proceedings of IEEE International Symposium on Information Theory, 2005.

F. Attneave, Some informational aspects of visual perception., Psychological Review, vol.61, issue.3, pp.183-193, 1954.
DOI : 10.1037/h0054663

S. Haykin, Neural Networks. A Comprehensive Foundation, 2005.

R. Linsker, An application of the principle of maximum information preservation to linear systems, Advances in Neural Information Processing Systems Conference, 1988.

J. Bruck and M. Blaum, Neural networks, error-correcting codes, and polynomials over the binary n-cube, IEEE Transactions on Information Theory, vol.35, issue.5, pp.976-987, 1989.
DOI : 10.1109/18.42215

Y. Tseng and J. Wu, High-order perceptrons for decoding error-correcting codes, IEEE International Joint Conference on Neural Networks, pp.24-29, 1992.

L. Personnaz and I. Rivals, Réseaux de neurones formels pour la modélisation, la commande et la classification, ser, 2003.

J. Hertz, A. Krogh, and R. Palmer, Introduction to the theory of neural computation, 1991.

B. Hassibi, D. Stork, and G. Wolff, Optimal brain surgeon and general network pruningoptimal brain surgeon and general network pruning, IEEE International Conference on Neural Networks, pp.293-299, 1993.
DOI : 10.1109/icnn.1993.298572

D. E. Rumelhart, G. E. Hinton, and R. J. Williams, Learning internal representations by error backpropagation Parallel distributed processing PGApack: Parallel genetic algorithm library, Argonne National Laboratory, pp.318-362, 1986.

L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Journal canadien de math??matiques, vol.8, issue.0, pp.399-404, 1956.
DOI : 10.4153/CJM-1956-045-5

P. Comon, Independent component analysis, A new concept?, Signal Processing, vol.36, issue.3, pp.287-314, 1994.
DOI : 10.1016/0165-1684(94)90029-9

URL : https://hal.archives-ouvertes.fr/hal-00417283

N. Cristianini and J. Shawe-taylor, Support vector machines and other kernelbased learning methods, 2000.

A. Guttman, A dynamic index structure for spatial searching, ACM SIGMOD International Conference on Management of Data, pp.47-57, 1984.

P. Indyk and R. Motwani, Approximate nearest neighbors, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.604-613, 1998.
DOI : 10.1145/276698.276876

C. Faloutsos and I. Kamel, Beyond uniformity and independence, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '94, pp.4-13, 1994.
DOI : 10.1145/182591.182593

A. Belussi and C. Faloutsos, Estimating the selectivity of spatial queries using the 'correlation' fractal dimension, International Conf. on Very Large Data Base, pp.299-310, 1995.

S. R. Simanca and S. Sutherland, Mathematical problem solving with computers, " in The University at Stony Brook, ser. Lecture Notes for MAT 331, 2002.

A. Broder, R. Krauthgamer, and M. Mitzenmacher, Improved classification via connectivity information, Symposium on Discrete Algorithms, 2000.

M. Naphade, I. Kozintsev, and T. Huang, A factor graph framework for semantic indexing and retrieval in video, 2000 Proceedings Workshop on Content-based Access of Image and Video Libraries, pp.40-52, 2002.
DOI : 10.1109/IVL.2000.853836

M. Boutell, J. Luo, and C. Brown, Factor Graphs for Region-based Whole-scene Classification, 2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'06), 2006.
DOI : 10.1109/CVPRW.2006.78

L. Bazzi, T. Richardson, and R. Urbanke, Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A, IEEE Transactions on Information Theory, vol.50, issue.9, pp.2010-2021, 2004.
DOI : 10.1109/TIT.2004.833352

V. Zyablov and M. S. Pinsker, Estimation of the error-correction complexity for gallager low-density codes, Problems of Information Transmission, vol.11, issue.1, pp.18-28, 1976.

M. Sipser and D. Spielman, Expander codes, IEEE Transactions on Information Theory, vol.42, issue.6, pp.1710-1722, 1996.
DOI : 10.1109/18.556667

D. Burshtein and G. Miller, Expander graph arguments for message-passing algorithms, IEEE Transactions on Information Theory, vol.47, issue.2, pp.782-790, 2001.
DOI : 10.1109/18.910588

M. Ivkovic, S. K. Chilappagari, and B. Vasic, Eliminating trapping sets in lowdensity parity check codes using tanner graph lifting, Proceedings of IEEE International Symposium on Information Theory, pp.2266-2270, 2007.

C. Di, D. Proietti, T. Richardson, E. Teletar, and R. Urbanke, Finite length analysis of low-density parity-check codes, IEEE Tansactions on Information Theory, vol.48, pp.1570-1579, 2002.

D. Burshtein, On the error correction of regular LDPC codes using the flipping algorithm, Proceedings of IEEE International Symposium on Information Theory, pp.226-230, 2007.

S. K. Chilappagari, D. V. Nguyen, B. Vasic, and M. W. Marcellin, On the guaranteed error correction capability of LDPC codes, 2008 IEEE International Symposium on Information Theory, 2008.
DOI : 10.1109/ISIT.2008.4595023

S. K. Chilappagari, A. R. Krishnan, and B. Vasic, LDPC codes which can correct three errors under iterative decoding, 2008 IEEE Information Theory Workshop, 2008.
DOI : 10.1109/ITW.2008.4578696

A. R. Krishnan, S. K. Chilappagari, and B. Vasic, On error correction capability of column-weight-four ldpc codes, 2008.

E. Sharon, A. Ashikhmin, and S. Litsyn, EXIT functions for the Gaussian channel, Proceedings of 40th Annu. Allerton Conf. Communication, Control, Computers, pp.972-981, 2003.

C. Poulliat, M. Fossorier, and D. Declercq, Using binary image of nonbinary LDPC codes to improve overall performance, Proceedings of IEEE International Symposium on Turbo Codes, 2006.

A. Voicila, D. Declercq, F. Verdier, M. Fossorier, and P. Urard, Low complexity decoding for non-binary LDPC codes in high order fields Non-binary hybrid LDPC codes: Structure, decoding and optimization, IEEE Transactions on Communications Proceedings of IEEE Information Theory Workshop, 2006.

L. Sassatelli, W. Henkel, and D. Declercq, Check irregular LDPC codes for unequal error protection under iterative decoding, Proceedings of IEEE International Symposium on Turbo Codes, 2006.

G. Byers and F. Takawira, EXIT charts for non-binary LDPC codes, IEEE International Conference on Communications, 2005. ICC 2005. 2005, pp.652-657, 2005.
DOI : 10.1109/ICC.2005.1494432

D. Declercq, M. Colas, and G. Gelle, Regular GF(2 q )-LDPC coded modulations for higher order QAM-AWGN channels, Proceedings of ISITA, 2004.

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

O. Wintzell, M. Lentmaier, and K. Zigangirov, Asymptotic analysis of superorthogonal turbo codes, IEEE Transactions on Information Theory, vol.49, issue.1, pp.253-258, 2003.
DOI : 10.1109/TIT.2002.806143

K. Li, X. Wang, and A. Ashikhmin, EXIT Functions of Hadamard Components in Repeat-Zigzag-Hadamard (RZH) Codes, 2007 IEEE International Symposium on Information Theory, 2007.
DOI : 10.1109/ISIT.2007.4557335

J. Hamkins and D. Divsalar, Coupled receiver-decoders for low rate turbo codes, IEEE International Symposium on Information Theory, 2003. Proceedings., 2003.
DOI : 10.1109/ISIT.2003.1228397

H. Jin and R. Mceliece, RA Codes Achieve AWGN Channel Capacity, Proceedings of IEEE International Symposium on Applied Algebra and Error-Correcting Codes, pp.14-19, 1999.
DOI : 10.1007/3-540-46796-3_2