L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate (corresp.). Information Theory, IEEE Transactions on, vol.20, issue.2, p.284287, 1974.

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, p.549583, 2006.
DOI : 10.1109/TIT.2005.862080

C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1, Proceedings of ICC '93, IEEE International Conference on Communications, p.10641070, 1993.
DOI : 10.1109/ICC.1993.397441

E. Biglieri, J. Proakis, and S. Shamai, Fading channels: information-theoretic and communications aspects, IEEE Transactions on Information Theory, vol.44, issue.6, p.26192692, 1998.
DOI : 10.1109/18.720551
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2228

R. C. Bose and D. K. Ray-chaudhuri, On a class of error correcting binary group codes, Information and Control, vol.3, issue.1, p.6879, 1960.
DOI : 10.1016/S0019-9958(60)90287-4

J. J. Boutros, E. C. Strinati, and A. G. Fabregas, Turbo code design for block fading channels, Proc. 42nd Annual Allerton Conference on Communication, Control and Computing, 2004.

J. J. Boutros, A. Guillén-i-fabregás, E. Biglieri, and G. Zémor, Design and Analysis of Low-Density Parity-Check Codes for Block-Fading Channels, 2007 Information Theory and Applications Workshop, p.5462, 2007.
DOI : 10.1109/ITA.2007.4357562

J. Campello, D. S. Modha, and S. Rajagopalan, Designing ldpc codes using bit-lling, Communications, 2001. ICC 2001. IEEE International Conference on, p.5559, 2001.

W. Chen, C. Poulliat, D. Declercq, L. Conde-canencia, A. et al., Non-binary ldpc codes dened over the general linear group: nite length design and practical implementation issues, Vehicular Technology Conference, p.15, 2009.

S. Y. Chung, G. D. Forney-jr, T. J. Richardson, and R. Urbanke, On the design of lowdensity parity-check codes within 0.0045 db of the shannon limit, Communications Letters, vol.5, issue.2, p.5860, 2001.

S. Y. Chung, T. J. Richardson, and R. L. Urbanke, Analysis of sum-product decoding of low-density parity-check codes using a gaussian approximation. Information Theory, IEEE Transactions on, issue.2, p.47657670, 2001.

M. C. Davey and D. J. Mackay, Low density parity check codes over GF(q), IEEE Commun. Lett, vol.2, p.165167, 1998.

M. C. Davey and D. J. Mackay, Monte Carlo simulations of innite low density parity check codes over GF(q), International Workshop on Optimal Codes and Related Topics (OC98), 1998.

M. C. Davey, Error-correction using low-density parity-check codes. Univ. of Cambridge PhD dissertation, 1999.

D. Declercq and M. Fossorier, Decoding algorithms for non-binary LDPC codes over GF(q), IEEE Trans. Commun, vol.55, issue.4, p.633643, 2007.

D. Declercq, V. Savin, and S. Petschinger, Multi-relay cooperative NB-LDPC coding with non-binary repetition codes, International Conference on Networks (ICN), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00764067

C. Di, D. Proietti, . Telatar, R. Tj-richardson, and . Urbanke, Finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Transactions on Information Theory, issue.6, p.4815701579, 2002.

D. Divsalar, H. Jin, and R. J. Mceliece, Coding theorems for "turbo-like" codes, Proceedings of the annual Allerton Conference on Communication control and Computing, p.201210, 1998.

G. D. Forney-jr, The viterbi algorithm, Proceedings of the IEEE, p.268278, 1973.
DOI : 10.1109/PROC.1973.9030

M. P. Fossorier, Quasicyclic low-density parity-check codes from circulant permutation matrices. Information Theory, IEEE Transactions on, issue.8, p.5017881793, 2004.

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

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

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

J. Ha, J. Kim, and S. W. Mclaughlin, Rate-compatible puncturing of low-density parity-check codes. Information Theory, IEEE Transactions on, issue.11, p.5028242836, 2004.

J. Ha, J. Kim, D. Klinc, and S. W. Mclaughlin, Rate compatible punctured lowdensity parity-check codes with short block lengths, IEEE Trans. on Inform. Theory, p.52728738, 2006.

R. W. Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal, vol.29, issue.2, pp.147160-143, 1950.
DOI : 10.1002/j.1538-7305.1950.tb00463.x
URL : http://campus.unibo.it/10913/1/hamming1950.pdf

A. Hocquenghem, Codes correcteurs d'erreurs, Chires, vol.2, issue.2, p.14756, 1959.

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

X. Y. Hu and M. P. Fossorier, On the computation of the minimum distance of low density parity check codes, IEEE, Inter. Conf. Comm., volume, p.767771, 2004.

X. Y. Hu, E. Eleftheriou, and D. M. Arnold, Regular and irregular progressive edgegrowth tanner graphs, IEEE Trans. Inform. Theory, vol.51, issue.1, p.386398, 2005.

A. Guillén-i-fàbregas and G. Caire, Coded modulation in the block-fading channel: coding theorems and code construction, IEEE Transactions on Information Theory, vol.52, issue.1, p.91114, 2006.
DOI : 10.1109/TIT.2005.860414

H. Jin, A. Khandekar, and R. Mceliece, Irregular repeat-accumulate codes, Proc. 2nd Int. Symp. Turbo codes and related topics, p.18, 2000.

K. Kasai and K. Sakaniwa, Fountain codes with multiplicatively repeated non-binary LDPC codes, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing, p.374378, 2010.
DOI : 10.1109/ISTC.2010.5613905

K. Kasai, D. Declercq, C. Poulliat, and K. Sakaniwa, Multiplicatively Repeated Nonbinary LDPC Codes, IEEE Transactions on Information Theory, vol.57, issue.10, p.67886795, 2011.
DOI : 10.1109/TIT.2011.2162259
URL : https://hal.archives-ouvertes.fr/hal-00764119

D. Klinc, J. Ha, and S. W. Mclaughlin, On rate-adaptability of non-binary LDPC codes, 5th International Symposium on Turbo codes and related topics, 2008.

R. Knopp and P. A. Humblet, On coding for block fading channels, IEEE Transactions on Information Theory, vol.46, issue.1, p.189205, 2000.
DOI : 10.1109/18.817517

Y. Kou, S. Lin, and M. P. Fossorier, Low density parity check codes based on nite geometries: a rediscovery and new results, IEEE, Trans. Inform. Theory, issue.7, pp.47-27112735, 2001.

A. Lapidoth, The performance of convolutional codes on the block erasure channel using various finite interleaving techniques, IEEE Transactions on Information Theory, vol.40, issue.5, pp.1459-1473, 1994.
DOI : 10.1109/18.333861

F. Lehman, Les systèmes de décodage itératif et leurs applications aux modems laires et non-laires

F. Lehmann and G. M. Maggio, Analysis of the iterative decoding of ldpc and product codes using the gaussian approximation. Information Theory, IEEE Transactions on, issue.11, p.4929933000, 2003.

G. Li, I. J. Fair, and W. A. Krzymie, Density Evolution for Nonbinary LDPC Codes Under Gaussian Approximation, IEEE Transactions on Information Theory, vol.55, issue.3, p.55, 2009.
DOI : 10.1109/TIT.2008.2011435

M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, Improved lowdensity parity-check codes using irregular graphs. Information Theory, IEEE Transactions on, vol.47, issue.2, p.585598, 2001.
DOI : 10.1109/18.910576
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.6057

E. Lutz, Code and interleaver design for data transmission over fading channels, Proceedings Global Telecommunications Conference, p.124, 1984.

D. J. Mackay, Good error-correcting codes based on very sparse matrices, IEEE Trans. Inform. Theory, vol.45, issue.2, p.399431, 1999.

E. Malkamaki and H. Leib, Coded diversity on block-fading channels, IEEE Transactions on Information Theory, vol.45, issue.2, p.771781, 1999.
DOI : 10.1109/18.749028

E. Malkamaki and H. Leib, Evaluating the performance of convolutional codes over block fading channels, IEEE Transactions on Information Theory, vol.45, issue.5, p.16431646, 1999.
DOI : 10.1109/18.771235

A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang, Stopping sets and the girth of Tanner graphs, Proceedings IEEE International Symposium on Information Theory,, p.2, 2002.
DOI : 10.1109/ISIT.2002.1023274

A. Orlitsky, K. Viswanathan, and J. Zhang, Stopping set distribution of ldpc code ensembles. Information Theory, IEEE Transactions on, vol.51, issue.3, p.929953, 2005.

L. H. Ozarow, S. Shamai, and A. D. Wyner, Information theoretic considerations for cellular mobile radio. Vehicular Technology, IEEE Transactions on, vol.43, issue.2, p.359378, 1994.

S. Petschinger and D. Declercq, Non-binary coding for vector channels, IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), p.2630, 2011.

L. and P. Sy, Codes correcteurs d'erreurs au niveau applicatif pour les télécommunications par satellite

C. Poulliat, M. Fossorier, and D. Declercq, Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images, IEEE Transactions on Communications, vol.56, issue.10, p.5616261635, 2008.
DOI : 10.1109/TCOMM.2008.060527

J. Ramsey, Realization of optimum interleavers Information Theory, IEEE Transactions on, vol.16, issue.3, p.338345, 1970.

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

I. S. Reed and G. Solomon, Polynomial codes over certain nite elds, Journal of the Society for Industrial and Applied Mathematics, vol.8, issue.2, p.300304, 1960.
DOI : 10.1137/0108018

T. Richardson, Error oors of LDPC codes, Proc. Annual Allerton Conference on Coomunication Control and Computing, p.14261435, 2003.

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, p.599618, 2001.
DOI : 10.1109/18.910577

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

T. J. Richardson and R. L. Urbanke, Ecient encoding of low-density parity-check codes. Information Theory, IEEE Transactions on, vol.47, issue.2, p.638656, 2001.

T. J. Richardson and R. L. Urbanke, Modern coding theory, 2008.
DOI : 10.1017/CBO9780511791338

L. Sassatelli and D. Declercq, Non-binary Hybrid LDPC Codes: structure, decoding and optimization, 2006 IEEE Information Theory Workshop, ITW '06 Chengdu, p.7175, 2006.
DOI : 10.1109/ITW2.2006.323759
URL : http://arxiv.org/abs/cs/0701066

V. Savin, Non binary LDPC codes over the binary erasure channel: Density evolution analysis, 2008 First International Symposium on Applied Sciences on Biomedical and Communication Technologies, 2008.
DOI : 10.1109/ISABEL.2008.4712621

V. Savin, Min-Max decoding for non binary LDPC codes, 2008 IEEE International Symposium on Information Theory, 2008.
DOI : 10.1109/ISIT.2008.4595129

C. E. Shannon, A mathematical theory of communications, i and ii

H. Song and J. Cruz, Reduced-complexity decoding of q-ary ldpc codes for magnetic recording, Magnetics IEEE Transactions on, vol.39, issue.2, p.10811087, 2003.

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

R. Storn and K. Price, Dierential evolution -a simple and ecient heuristic for global optimization over continuous spaces, Journal of Global Optimization, vol.11, issue.4, pp.341-359, 1997.
DOI : 10.1023/A:1008202821328

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

R. M. Tanner, Minimum-distance bounds by graph analysis, IEEE Transactions on Information Theory, vol.47, issue.2, p.808821, 2001.
DOI : 10.1109/18.910591

A. Venkiah, D. Declercq, and C. Poulliat, Design of cages with a randomized progressive edge-growth algorithm, IEEE Communications Letters, vol.12, issue.4, p.301303, 2008.
DOI : 10.1109/LCOMM.2008.071843
URL : https://hal.archives-ouvertes.fr/hal-00521059

A. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. Information Theory, IEEE Transactions on, vol.13, issue.2, p.260269, 1967.

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

B. Vucetic and J. Yuan, Turbo codes: principles and applications, 2000.
DOI : 10.1007/978-1-4615-4469-2

N. Wiberg, Codes and decoding on general graphs, 1996.

H. Wymeersch, H. Steendam, and M. Moeneclaey, Log-domain decoding of ldpc codes over gf (q) In Communications, IEEE International Conference on, p.772776, 2004.