F. Mattoussi, V. Roca, and B. Sayadi, Complexity comparison of the use of Vandermonde versus Hankel matrices to build systematic MDS Reed-Solomon codes, 2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2012.
DOI : 10.1109/SPAWC.2012.6292924
URL : https://hal.archives-ouvertes.fr/hal-00719314

F. Mattoussi, V. Savin, V. Roca, and B. Sayadi, Optimization with exit functions of GLDPC-Staircase codes for the BEC, 2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2012.
DOI : 10.1109/SPAWC.2012.6292979
URL : https://hal.archives-ouvertes.fr/hal-00719321

F. Mattoussi, V. Roca, and B. Sayadi, Design of small rate, close to ideal, gldpcstaircase al-fec codes for the erasure channel, IEEE Global Communications Conference (Globecom), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00736071

F. Mattoussi, V. Roca, and B. Sayadi, Good coupling between LDPC-staircase and Reed-Solomon for the design of GLDPC codes for the erasure channel, 2013 IEEE Wireless Communications and Networking Conference (WCNC), p.2013
DOI : 10.1109/WCNC.2013.6554790
URL : https://hal.archives-ouvertes.fr/hal-00781921

E. Paolini, Iterative Decoding Methods Based on Low-Density Graphs, 2007.

. Emm-efec, selection of the fec. document S4-121367, 3GPP TSG-SA4 meeting 71, WG4 CODEC, 2012.

C. E. Shannon, A mathematical theory of communication. The Bell System Technical Journal, pp.379-423, 1948.

H. Bai and H. Aerospace, Error modeling schemes for fading channels in wireless communications: A survey, IEEE Communications Surveys & Tutorials, vol.5, issue.2, pp.2-9, 2003.
DOI : 10.1109/COMST.2003.5341334

M. Yajnik, S. B. Moon, J. Kurose, and D. Towsley, Measurement and modeling of the temporal dependence in packet loss, IEEE INFOCOM, pp.345-352, 1999.

H. Ernst, L. Sartorello, and S. Scalise, Transport layer coding for the land mobile satellite channel, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514), 2004.
DOI : 10.1109/VETECS.2004.1391458

K. Bouchireb and P. Duhamel, Transmission Schemes for Scalable Video Streaming in a Multicast Environment, 2008 International Wireless Communications and Mobile Computing Conference, pp.419-424, 2008.
DOI : 10.1109/IWCMC.2008.73

S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf et al., Delay-tolerant networking: an approach to interplanetary Internet, IEEE Communications Magazine, vol.41, issue.6, pp.41128-136, 2003.
DOI : 10.1109/MCOM.2003.1204759

L. Vicisano, L. Rizzo, M. Luby, J. Gemmell, and J. Crowcroft, Asynchronous layered coding (alc) protocol instantiation, IETF Request for Comments, p.3450, 2002.

T. Paila, M. Luby, R. Lehtonen, V. Roca, and R. Walsh, Flute -file delivery over unidirectional transport. IETF RMT Working Group, Request For Comments, 2004.
DOI : 10.17487/rfc6726
URL : https://hal.archives-ouvertes.fr/hal-00749951

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

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

]. D. 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, pp.472711-2736, 2001.
DOI : 10.1109/18.959255
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.3023

M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.6057

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

S. Y. Chung, G. D. Forneya, 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

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. Xiao and A. H. Banihashemi, Graph-Based Message-Passing Schedules for Decoding LDPC Codes, IEEE Transactions on Communications, vol.52, issue.12, pp.2098-2105, 2004.
DOI : 10.1109/TCOMM.2004.838730

H. Song, R. M. Todd, and J. R. Cruz, Low density parity check codes for magnetic recording channels, IEEE Transactions on Magnetics, vol.36, issue.5, pp.2183-2186, 2000.
DOI : 10.1109/20.908351

D. 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

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

P. Oswald and M. A. Shokrollahi, Capacity-achieving sequences for the erasure channel, IEEE Transactions on Information Theory, vol.48, issue.12, pp.3017-3028, 2002.
DOI : 10.1109/TIT.2002.805067

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

T. Richardson, Error floors of ldpc codes, Proceding of Allerton Conference on Communication, Control and Computing, 2003.

A. Amraoui, A. Montanari, and R. Urbanke, How to find good finite-length codes: from art towards science, Proceding 4th International Symposium on Turbo Codes and Related Topics, 2006.
DOI : 10.1002/ett.1182
URL : https://hal.archives-ouvertes.fr/hal-00290797

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

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

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

M. Lentmaier and K. 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

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

J. Chen and R. Tanner, A hybrid coding scheme for the Gilbert-Elliott channel, IEEE Transactions on Communications, vol.54, issue.10, pp.1787-1796, 2006.
DOI : 10.1109/TCOMM.2006.881365

N. Miladinovic and M. Fossorier, Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005., 2005.
DOI : 10.1109/GLOCOM.2005.1577850

I. Djordjevic, O. Milenkovic, and B. Vasic, Generalized low-density parity-check codes for optical communication systems, Journal of Lightwave Technology, vol.23, issue.5, pp.1939-1946, 2005.
DOI : 10.1109/JLT.2005.846892
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.473.7400

Y. Wang and M. Fossorier, Doubly Generalized LDPC Codes, 2006 IEEE International Symposium on Information Theory, pp.669-673, 2006.
DOI : 10.1109/ISIT.2006.261869
URL : https://hal.archives-ouvertes.fr/hal-00865899

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.

M. Watson, A. Begen, and V. Roca, Forward Error Correction (FEC) Framework, 2011. IETF Request for Comments, RFC, vol.6363
DOI : 10.17487/rfc6363
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3307

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

J. Lacan, V. Roca, J. Peltotalo, and S. Peltotalo, Reed-solomon error correction scheme. IETF RMT Working Group, Request for Comments, 2009.
DOI : 10.17487/rfc5510
URL : https://hal.archives-ouvertes.fr/hal-00799727

M. Cunche, V. Roca, and J. Lacan, Simple low-density parity check (ldpc) staircase forward error correction (fec) scheme for fecframe. IETF Request for Comments, RFC, vol.6816, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00781906

J. Lacan, A. Bouabdallah, V. Roca, M. Cunche, and K. Matsuzono, Simple reedsolomon forward error correction (fec) scheme for fecframe, IETF Request for Comments, RFC, vol.6865, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00799727

M. Cunche, Codes al-fec hautes performances pour les canaux déffacements : variations autour des codes ldpc, 2010.

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

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

M. Jiang, Z. Shi, C. Zhao, and Y. Chen, An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes, IEEE Communications Letters, vol.9, issue.9, pp.814-816, 2005.
DOI : 10.1109/LCOMM.2005.1506712

A. Nouh and A. Banihashemi, Bootstrap decoding of low-density parity-check codes, IEEE Communications Letters, vol.6, issue.9, pp.391-393, 2002.
DOI : 10.1109/LCOMM.2002.803481

P. Elias, Coding for two noisy channels, Proceedings 3rd London Symposium Information Theory, pp.61-76, 1955.

R. Singleton, Maximum distance<tex>q</tex>-nary codes, IEEE Transactions on Information Theory, vol.10, issue.2, pp.116-118, 1964.
DOI : 10.1109/TIT.1964.1053661

M. Luby, M. Mitzenmacher, A. Shokrollah, and D. Spielman, Analysis of low density codes and improved designs using irregular graphs, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.249-258, 1998.
DOI : 10.1145/276698.276756

C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, Finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Transactions on Information Theory, vol.48, issue.6, pp.1570-1579, 2002.

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

H. Jin, A. Khandekar, and R. Mceliece, Irregular repeat-accumulate codes, Proc. 2nd International Symposium on Turbo Codes and Related Topics, pp.1-8, 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

N. Alon and M. Luby, A linear time erasure-resilient code with nearly optimal recovery, IEEE Transactions on Information Theory, vol.42, issue.6, pp.1732-1736, 1996.
DOI : 10.1109/18.556669
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.8875

. H. Tang, Y. Xu, . Kou, and K. Lin, On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes, IEEE Transactions on Information Theory, vol.50, issue.6, pp.1269-1279, 2004.
DOI : 10.1109/TIT.2004.828088

D. J. Mackay and R. M. 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

B. Ammar, B. Honary, Y. Kou, J. Xu, and S. Lin, Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs, IEEE Transactions on Information Theory, vol.50, issue.6, pp.1257-1269, 2004.
DOI : 10.1109/TIT.2004.828144

B. J. Frey and D. J. Mackay, Irregular turbo codes, Proceedings of the 37th Allerton Conference on Communication, Control, and Computing, 1999.

H. Tang, J. Xu, S. Lin, and K. A. , Codes on Finite Geometries, IEEE Transactions on Information Theory, vol.51, issue.2, pp.572-597, 2005.
DOI : 10.1109/TIT.2004.840867

Y. Y. Tai, L. Chen, S. Lin, L. Lan, L. Zeng et al., Construction of quasi-cyclic ldpc codes for awgn and binary erasure channels: a finite field approach, IEEE Transactions on Information Theory, vol.53, issue.7, pp.2429-2458, 2007.

T. R. Oening and J. Moon, A low-density generator matrix interpretation of parallel concatenated single bit parity codes, IEEE Transactions on Magnetics, vol.37, issue.2, pp.737-741, 2001.
DOI : 10.1109/20.917609

J. Garcia-frias and W. Zhong, Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix, IEEE Communications Letters, vol.7, issue.6, pp.266-268, 2003.
DOI : 10.1109/LCOMM.2003.813816

T. J. Richardson and J. Moon, Efficient encoding of low-density parity-check codes, IEEE Transactions on Information Theory, vol.47, issue.2, pp.638-656, 2001.
DOI : 10.1109/18.910579

D. Divsalar, H. Jin, and R. J. Mceliece, Coding theorems for turbo-like codes, Proceedings 36 Annual Allerton Conference on Communication, Control, and Computing, pp.201-210, 1998.

S. Lin and D. J. Costello, Error control coding, 2004.

V. V. Zyablov and M. S. Pinsker, Decoding complexity of low-density codes for transmission in a channel with erasures, Problemy Peredachi Informatsii, vol.10, issue.1, pp.15-28, 1974.

A. Shokrollahi, Ldpc codes: An introduction. Digital Fountain, 2003.

H. Pishro-nik and F. Fekri, On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel, IEEE Transactions on Information Theory, vol.50, issue.3, pp.439-454, 2004.
DOI : 10.1109/TIT.2004.824918

G. Miller and D. Burshtein, Bounds on the maximum likelihood decoding error probability of low density parity check codes, Proceedings. IEEE International Symposium on In Information Theory, 2000.

M. Cunche and V. Roca, Optimizing the error recovery capabilities of LDPC-staircase codes featuring a Gaussian elimination decoding scheme, 2008 10th International Workshop on Signal Processing for Space Communications, 2008.
DOI : 10.1109/SPSC.2008.4686723
URL : https://hal.archives-ouvertes.fr/inria-00291656

E. Paolini, G. Liva, B. Matuz, and M. Chiani, Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding, IEEE Communications Letters, vol.12, issue.6, pp.450-452, 2008.
DOI : 10.1109/LCOMM.2008.080221

E. Paolini, M. Varrella, M. Chiani, B. Matuz, and G. Liva, Low-complexity ldpc codes with near-optimum performance over the bec. CoRR, abs/0804, pp.274-282, 2008.

S. Brink, Convergence of iterative decoding, Electronics Letters, vol.35, issue.10, pp.806-808, 1999.
DOI : 10.1049/el:19990555

S. Brink, Iterative decoding trajectories of parallel concatenated codes, Proc. 3rd IEE/ITG Conference on Source and Channel Coding, pp.75-80, 2000.

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

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

M. Ardakani and F. R. Kschischang, Designing irregular ldpc codes using exit charts based on message error probability, Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2002.
DOI : 10.1109/isit.2002.1023726

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

D. Divsalar, S. Dolinar, and F. Pollara, Low complexity turbo-like codes, Proceedings of the 2nd International Symposium on Turbo Codes and Related Topics, pp.73-80, 2000.

S. Brink, M. Tüchler, and J. Hagenauer, Measures for tracing convergence of iterative decoding algorithms, Proceedings 4th International IEEE/ITG Conference on Source and Channel Coding, pp.53-60, 2002.

M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, Practical loss-resilient codes, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.150-159, 1997.
DOI : 10.1145/258533.258573
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5754

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

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

D. Mackay and M. Postol, Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check Codes, Electronic Notes in Theoretical Computer Science, vol.74, pp.97-104, 2003.
DOI : 10.1016/S1571-0661(04)80768-0

R. Lucas, M. P. Fossorier, Y. Kou, and S. Lin, Iterative decoding of one-step majority logic deductible codes based on belief propagation, IEEE Transactions on Communications, vol.48, issue.6, pp.931-937, 2000.
DOI : 10.1109/26.848552

S. Kim, J. No, H. Chung, and D. Shin, Girth analysis of tanner's (3,5) qc ldpc codes, Proceedings of IEEE International Symposium on Information Theory (ISIT), pp.1632-1636, 2005.

J. Lu, J. M. Moura, and U. Niesen, Grouping-and-shifting designs for structured ldpc codes with large girth, Proceedings of IEEE International Symposium on Information Theory (ISIT), p.236

]. B. Vasic, K. Pedagani, and M. Ivkovic, High-Rate Girth-Eight Low-Density Parity-Check Codes on Rectangular Integer Lattices, IEEE Transactions on Communications, vol.52, issue.8, pp.1248-1252, 2004.
DOI : 10.1109/TCOMM.2004.833037
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.612.5525

H. Song, J. Liu, B. V. Vijaya, and . Kumar, Large Girth Cycle Codes for Partial Response Channels, IEEE Transactions on Magnetics, vol.40, issue.4, pp.3084-3086, 2004.
DOI : 10.1109/TMAG.2004.829197

J. Lu, J. M. Moura, and U. Niesen, A class of structured LDPC codes with large girth, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), pp.425-429, 2004.
DOI : 10.1109/ICC.2004.1312524

H. Zhang and J. M. Moura, The design of structured regular ldpc codes with large girth, Proceedings of IEEE Global Telecommunications Conference, pp.4022-4027, 2003.

Y. Xiao and M. H. Lee, Construction of good quasi-cyclic ldpc codes, Proceedings of IET International Conference on Wireless Mobile and Multimedia Networks (ICWMMN), p.172, 2006.

J. Fan and Y. Xiao, A Method of Counting the Number of Cycles in LDPC Codes, 2006 8th international Conference on Signal Processing, pp.2183-2186, 2006.
DOI : 10.1109/ICOSP.2006.345906

A. Orlitsky, K. Viswanathan, and J. Zhang, Stopping Set Distribution of LDPC Code Ensembles, IEEE Transactions on Information Theory, vol.51, issue.3, pp.929-953, 2005.
DOI : 10.1109/TIT.2004.842571

S. Laendner and O. Milenkovic, Algorithmic and Combinatorial Analysis of Trapping Sets in Structured LDPC Codes, 2005 International Conference on Wireless Networks, Communications and Mobile Computing, 2005.
DOI : 10.1109/WIRLES.2005.1549481

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

Y. Mao and A. H. Banihashemi, A heuristic search for good low-density paritycheck codes at short block lengths, Proceding IEEE International Conference Communication, 2001.

T. Tian, C. Jones, J. Villasenor, and R. D. , Construction of irregular LDPC codes with low error floors, IEEE International Conference on Communications, 2003. ICC '03., 2003.
DOI : 10.1109/ICC.2003.1203996

I. 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

F. J. Mcwilliams and N. J. Sloane, The theory of error correcting codes, 1977.

J. C. Moreira and P. G. Farrell, Essentials of error-control coding The Atrium, Southern Gate, 2006.

M. Blaum, A course on error correcting codes, 2001.

R. E. Blahut, Algebraic codes for data transmission, 2002.
DOI : 10.1017/CBO9780511800467

V. Guruswami and A. Vardy, Maximum-Likelihood Decoding of Reed???Solomon Codes is NP-Hard, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp.470-478, 2005.
DOI : 10.1109/TIT.2005.850102

D. J. Mackay, Digital fountain codes

D. J. Mackay, Fountain codes, IEE Proceedings - Communications, vol.152, issue.6, pp.1062-1068, 2005.
DOI : 10.1049/ip-com:20050237

W. Ryan and S. Lin, Channel codes: Classical and modern, 2009.
DOI : 10.1017/CBO9780511803253

M. Luby, LT codes, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.271-280, 2002.
DOI : 10.1109/SFCS.2002.1181950

A. Shokrollahi, Raptor codes, IEEE/ACM Transactions on Networking, vol.14, pp.2551-2567, 2006.
DOI : 10.1109/itwitwn.2007.4318034

M. Luby, A. Shokrollahi, M. Watson, and T. Stockhammer, Raptor forward error correction scheme for object delivery, IRFC, vol.5053, 2007.
DOI : 10.17487/rfc5053
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.4050

E. Etsi, ip datacast over dvb-h : Content delivery protocols (cdp), 2006.

M. Luby, A. Shokrollahi, M. Watson, T. Stockhammer, and L. Minder, Raptorq forward error correction scheme for object delivery, IRFC, vol.6330, 2011.
DOI : 10.17487/rfc6330

A. U. Pandya, S. D. Trapasiya, and S. S. Chinnam, Comparative analysis of al-fec raptor and raptorq over 3gpp embms network, International Journal of Electronics and Communication EngineeringIJECE), vol.2, issue.2, pp.169-178, 2013.

S. Lassen, R. Karp, and A. M. Shokrollahi, Systems and processes for decoding a chain reaction code through inactivation, US Patent, vol.7030785, 2006.

V. Roca and C. Neumann, Design, evaluation and comparison of four large block fec codecs, ldpc, ldgm, ldgm staircase and ldgm triangle, plus a reed-solomon small block fec codec, Research Report, vol.5225, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00070770

V. Roca, M. Cunche, C. Thienot, J. Detchart, and J. Lacan, RS &#x002B; LDPC-Staircase codes for the erasure channel: Standards, usage and performance, 2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
DOI : 10.1109/WiMOB.2013.6673424

J. Lacan and J. Fimes, A Construction of Matrices with No Singular Square Submatrices, Proceeding International Conference on Finite Fields and Applications, pp.145-147, 2003.
DOI : 10.1007/978-3-540-24633-6_11

J. Lacan and J. Fimes, Systematic MDS Erasure Codes Based on Vandermonde Matrices, IEEE Communications Letters, vol.8, issue.9, pp.570-572, 2004.
DOI : 10.1109/LCOMM.2004.833807
URL : http://oatao.univ-toulouse.fr/2176/1/Lacan_2176.pdf

R. M. Roth and G. Seroussi, On generator matrices of mds codes, IEEE Transactions on Information Theory, issue.6, pp.31826-830, 1985.

J. Fimes and J. Lacan, Estimation of the number of singular square submatrices of vandermonde matrices defined over a finite field, 2003.

I. Shparlinski, On singularity of generalized vandermonde matrices over finite fields, 2000.

I. Gohberg and V. Olshevsky, Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems, Journal of Complexity, vol.10, issue.4, pp.411-427, 1994.
DOI : 10.1006/jcom.1994.1021
URL : http://doi.org/10.1006/jcom.1994.1021

L. Rizzo, Effective erasure codes for reliable computer communication protocols, ACM SIGCOMM Computer Communication Review, vol.27, issue.2, pp.24-36, 1997.
DOI : 10.1145/263876.263881
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.7747

J. Bolot and A. V. Garcia, The case for fec-based error control for packet audio in the internet, ACM International Conference of Multimedia, 1996.

C. C. Tan and N. C. Beaulieu, On first-order Markov modeling for the Rayleigh fading channel, IEEE Transactions on Communications, vol.48, issue.12, pp.2032-2040, 2000.
DOI : 10.1109/26.891214

J. Bolot, S. Fosse-parisis, and D. Towsley, Adaptative fec-base error control for interactive audio in the internet, Annual Joint Conference of the IEEE Computer and Communications Societies Proceedings (INFOCOM), 1999.

H. Sanneck, G. Carle, and R. Koodli, A framework model for packet loss metrics based on loss runlength, SPIE/ACM SIGMM Multimedia Computing Network Conference, pp.177-187, 2000.

E. N. Gilbert, Capacity of a Burst-Noise Channel, Bell System Technical Journal, vol.39, issue.5, pp.1253-1266, 1960.
DOI : 10.1002/j.1538-7305.1960.tb03959.x

E. O. Elliot, A Model of the Switched Telephone Network for Data Communications, Bell System Technical Journal, vol.44, issue.1, pp.89-109, 1963.
DOI : 10.1002/j.1538-7305.1965.tb04139.x

A. Konrad, B. Zhao, A. Joseph, and R. Ludwig, A Markov-based channel model algorithm for wireless networks, Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems , MSWIM '01, 2001.
DOI : 10.1145/381591.381602

J. Jiang and K. Narayanan, Iterative Soft-Input Soft-Output Decoding of Reed&#8211;Solomon Codes by Adapting the Parity-Check Matrix, IEEE Transactions on Information Theory, vol.52, issue.8, pp.3746-3756, 2008.
DOI : 10.1109/TIT.2006.878176

B. Sayadi, A. Alloum, and V. Roca, Reed solomon codes on graph for dvb-sh streaming services, Wireless World Research Forum, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00390693

N. Badri, F. Vellambi, and . Fekri, An improved decoding algorithm for low-density parity-check codes over the binary erasure channel, GLOBECOM, page 5, 2005.

D. Chase, Class of algorithms for decoding block codes with channel measurement information, IEEE Transactions on Information Theory, vol.18, issue.1, pp.170-182, 1972.
DOI : 10.1109/TIT.1972.1054746

R. Pyndiah, Near-optimum decoding of product codes: block turbo codes, IEEE Transactions on Communications, vol.46, issue.8, pp.1003-1010, 1998.
DOI : 10.1109/26.705396

D. C. Cunha, J. Portugheis, and V. V. Nascimento, Symbol-Wise Chase Decoding of q-ary Block Codes over BI-AWGN Channels, IEEE Communications Letters, vol.15, issue.2, pp.229-231, 2011.
DOI : 10.1109/LCOMM.2011.122010.100864

C. Neumann and V. Roca, Analysis of FEC Codes for Partially Reliable Media Broadcasting Schemes, 2nd ACM International Workshop on Multimedia Interactive Protocols and Systems (MIPS?2004), 2004.
DOI : 10.1007/978-3-540-30493-7_10