R. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.1058

G. Yue, L. Ping, and X. Wang, Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints, IEEE Transactions on Information Theory, vol.53, issue.3, pp.1058-1079, 2007.
DOI : 10.1109/TIT.2006.890694

M. Lentmaier and K. S. Zigangirov, On generalized low-density parity-check codes based on Hamming component codes, IEEE Communications Letters, vol.3, issue.8, pp.248-250, 1999.
DOI : 10.1109/4234.781010

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

Y. Wang and M. Fossorier, CTH08-2: EXIT Chart Analysis for Doubly Generalized LDPC Codes, IEEE Globecom 2006, pp.1-6, 2006.
DOI : 10.1109/GLOCOM.2006.76

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

S. T. 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

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.2657-2673, 2004.
DOI : 10.1109/TIT.2004.836693

M. Cunche, V. Savin, V. Roca, G. Kraidy, A. Soro et al., Lowrate coding using incremental redundancy for GLDPC codes, IEEE Int. Workshop on Satellite and Space Comm, pp.299-303, 2008.
DOI : 10.1109/iwssc.2008.4656817
URL : https://hal.archives-ouvertes.fr/inria-00305684

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. Méasson, A. Montanari, and R. Urbanke, Maxwell's construction: the hidden bridge between maximum-likelihood and iterative decoding, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., p.225, 2004.
DOI : 10.1109/ISIT.2004.1365262

C. Méasson, Conservation laws for coding, 2006.

C. Méasson and R. Urbanke, An upper-bound for the ML threshold of iterative coding systems over the BEC, Proc. of the 41st Allerton Conf. on Communications, Control and Computing, p.3, 2003.

F. Mattoussi, V. Roca, and B. Sayadi, Design of small rate, close to ideal, GLDPC-staircase AL-FEC codes for the erasure channel, 2012 IEEE Global Communications Conference (GLOBECOM), p.2012
DOI : 10.1109/GLOCOM.2012.6503433
URL : https://hal.archives-ouvertes.fr/hal-00736071

V. Roca, C. Neumann, and D. Furodet, Low density parity check (LDPC)-staircase and triangle forward error correction (FEC) schemes, RFC, vol.5170, 2008.
DOI : 10.17487/rfc5170
URL : https://hal.archives-ouvertes.fr/inria-00000147

R. T. Paila, M. Luby, R. Lehtonen, V. Roca, and R. Walsh, FLUTE -File Delivery over Unidirectional Transport, 2004.
DOI : 10.17487/rfc6726
URL : https://hal.archives-ouvertes.fr/hal-00749951