.. Cas-des-attaques-intelligentes, 135 9.5.1 Prévention des attaques simples par extension de l'ensemble V des symboles vérifiés, p.136

P. Généralisation, 155 11.3.1 Codes linéaires par bloc et multiplication matricielle

S. Acharya, M. Franklin, and S. Zdonik, Dissemination-based data delivery using broadcast disks, IEEE Personal Communications, vol.2, issue.6, pp.50-60, 1995.
DOI : 10.1109/98.475988

D. P. Anderson, BOINC: A System for Public-Resource Computing and Storage, Fifth IEEE/ACM International Workshop on Grid Computing, pp.4-10, 2004.
DOI : 10.1109/GRID.2004.14

A. Avizienis, J. Laprie, and B. Randell, Dependability and Its Threats: A Taxonomy, IFIP Congress Topical Sessions, pp.91-120, 2004.
DOI : 10.1007/978-1-4020-8157-6_13

E. Berlekamp, Nonbinary BCH decoding Information Theory, IEEE Transactions on, vol.14, issue.2, pp.242-242, 1968.

E. R. Berlekamp, Algebraic coding theory, 1968.
DOI : 10.1142/9407

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

R. E. Blahut, Theory and Practice of Error Control Codes

M. Blaum and R. M. Roth, New array codes for multiple phased burst correction. Information Theory, IEEE Transactions on, vol.39, issue.1, pp.66-77, 1993.

J. Blömer, M. Kalfane, M. Karpinski, R. Karp, M. Luby et al., An xor-based erasure-resilient coding scheme, 1995.

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

G. Bosilca, R. Delmas, J. Dongarra, and J. Langou, Algorithmic based fault tolerance applied to high performance computing. CoRR, abs/0806, p.3121, 2008.

A. Bouabdallah, M. Kieffer, J. Lacan, G. Sabeva, G. Scot et al., Evaluation of Cross-Layer Reliability Mechanisms for Satellite Digital Multimedia Broadcast, IEEE Transactions on Broadcasting, vol.53, issue.1, pp.391-404, 2007.
DOI : 10.1109/TBC.2006.889209

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

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

J. Boutros, O. Pothier, and G. Zemor, Generalized low density (Tanner) codes. Communications, 1999. ICC'99, IEEE International Conference on, 1999.

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

D. Burshtein and G. Miller, An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel, IEEE Transactions on Information Theory, vol.50, issue.11, pp.2837-2844, 2004.
DOI : 10.1109/TIT.2004.836694

J. Byers, G. Itkis, M. C. Cheng, and A. Yeung, Securing bulk content almost for free, Computer Communications, vol.29, issue.3, pp.280-290, 2005.
DOI : 10.1016/j.comcom.2004.12.007

J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, A digital fountain approach to reliable distribution of bulk data, ACM SIGCOMM Computer Communication Review, vol.28, issue.4, pp.56-67, 1998.
DOI : 10.1145/285243.285258

A. Canteaut and F. Chabaud, A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511, IEEE Transactions on Information Theory, vol.44, issue.1, pp.367-378, 1998.
DOI : 10.1109/18.651067

P. Cataldi, M. P. Shatarski, M. Grangetto, and E. Magli, Implementation and Performance Evaluation of LT and Raptor Codes for Multimedia Applications, 2006 International Conference on Intelligent Information Hiding and Multimedia, pp.263-266, 2006.
DOI : 10.1109/IIH-MSP.2006.264994

P. Clements, P. Nettle, and R. Gallagher, Parity volume set specification 2, 2003.

M. Cluzeau and J. Tillich, On the code reverse engineering problem. Information Theory, ISIT 2008. IEEE International Symposium on, pp.634-638, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01081582

M. Cunche and V. Roca, Optimizing the error recovery capabilities of LDPCstaircase codes featuring a Gaussian Elimination decoding scheme, 10th IEEE International Workshop on Signal Processing for Space Communications (SPSC'08), 2008.
URL : https://hal.archives-ouvertes.fr/inria-00291656

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

M. Cunche and V. Roca, Adding integrity verification capabilities to the LDPC-staircase erasure correction codes. Global Telecommunications Conference, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00379155

G. I. David and J. A. Hansen, A preliminary exploration of striped hashing : a probabilistic scheme to speed up existing hash algorithms, Second International Conference on e-Business and Telecommunication Networks, 2005.

I. George, S. M. Davida, and . Reddy, Forward-error correction with decision feedback, Information and Control, vol.21, issue.2, pp.117-133, 1972.

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

D. Divsalar, H. Jin, and R. J. Mceliece, Coding theorems for " turbo-like " codes, Proceedings Thirty-Sixth Annual Allerton Conference on Communication, Control, and Computing, 1998.

H. Dobbertin, A. Bosselaers, and B. Preneel, RIPEMD-160 : A strengthened version of RIPEMD. Fast Software Encryption, LNCS, 1996.

J. Dumas and G. Villard, Computing the rank of large sparse matrices over finite fields, CASC'2002 Computer Algebra in Scientific Computing, pp.22-27, 2002.

A. Duminuco and E. Biersack, Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems, 2008 Eighth International Conference on Peer-to-Peer Computing, pp.89-98, 2008.
DOI : 10.1109/P2P.2008.9

A. Duminuco and E. Biersack, A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems, 2009 29th IEEE International Conference on Distributed Computing Systems, pp.376-384, 2009.
DOI : 10.1109/ICDCS.2009.14

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

P. C. Marc and . 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.

A. Francillon, V. Roca, C. Neumann, and P. Moniot, Secure transmission with error correcting code, 2008.

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

D. Gligoroski, S. J. Knapskog, and S. Andova, Cryptcoding -encryption and error-correction coding in a single step, Security and Management, pp.145-151, 2006.

A. Haken, M. Luby, G. Horn, J. Byers, J. Persch et al., On demand encoding with a window, US Patent, vol.6486803, 2002.

S. Hirst and B. Honary, Application of efficient Chase algorithm in decoding of generalized low-density parity-check codes, IEEE Communications Letters, vol.6, issue.9, pp.385-387, 2002.
DOI : 10.1109/LCOMM.2002.803487

D. E. Hocevar, A Reduced Complexity Decoder Architecture via Layered Decoding of LDPC Codes, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004., pp.107-112, 2004.
DOI : 10.1109/SIPS.2004.1363033

K. Huang and J. A. Abraham, Algorithm-based fault tolerance for matrix operations, IEEE Transactions on Computers, vol.33, issue.6, pp.518-528, 1984.

H. Imai and M. Hagiwara, Error-correcting codes and cryptography, Applicable Algebra in Engineering, Communication and Computing, vol.50, issue.10, pp.213-228, 2008.
DOI : 10.1007/s00200-008-0074-0

M. Jakobsson, J. P. Stern, and M. Yung, Scramble All, Encrypt Small, Proc. of Fast Software Encryption, pp.95-111, 1999.
DOI : 10.1007/3-540-48519-8_8

K. Kasai, T. Shibuya, and K. Sakaniwa, Detailed representation of irregular LDPC code ensembles and density evolution. Information Theory, Proceedings. IEEE International Symposium on, p.121, 2003.

R. Khalili and K. Salamatian, A New Analytic Approach to Evaluation of Packet Error Rate in Wireless Networks, 3rd Annual Communication Networks and Services Research Conference (CNSR'05), pp.333-338, 2005.
DOI : 10.1109/CNSR.2005.14

Y. Kou, S. Lin, and M. P. 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

M. Krohn, M. Freedman, and D. Eres, On-the-fly verification of rateless erasure codes for efficient content distribution, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004, 2004.
DOI : 10.1109/SECPRI.2004.1301326

J. Lacan, V. Roca, J. Peltotalo, and S. Peltotalo, Reed-Solomon Forward Error Correction (FEC) Schemes, IETF Request for Comments, 2009.
DOI : 10.17487/rfc5510

L. Lamport, R. Shostak, and M. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

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

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

M. Luby and M. Mitzenmacher, Verification-Based Decoding for Packet-Based Low-Density Parity-Check Codes, IEEE Transactions on Information Theory, vol.51, issue.1, 2005.
DOI : 10.1109/TIT.2004.839499

M. Luby, A. Shokrollahi, M. Watson, and T. Stockhammer, Raptor Forward Error Correction Scheme for Object Delivery, RFC, vol.5053, 2007.
DOI : 10.17487/rfc5053

M. Luby, M. Mitzenmacher, A. Shokrollahi, D. 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

M. Luby, M. Mitzenmacher, M. A. Shokrollahi, M. Amin, S. Daniel et al., 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

D. Mackay, Information Theory, Inference and Learning Algorithms, p.521642981, 2003.

J. C. David, R. M. Mackay, and . Neal, Near shannon limit performance of low density parity check codes, Electronics Letters, vol.32, pp.1645-1646, 1996.

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes (North-Holland Mathematical Library), 1983.

J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 1969.
DOI : 10.1109/TIT.1969.1054260

M. Cunche and V. Roca, Improving the Decoding of LDPC Codes for the Packet Erasure Channel with a Hybrid Zyablov Iterative Decoding/Gaussian Elimination Scheme, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00263682

M. Cunche and V. Roca, Le RFC 5170 en pratique : conception et évaluation d'un codec AL-FEC LDPC-staircase hautes performances, 2009.

K. Chetan-nanjunda-mathur, K. P. Narayan, and . Subbalakshmi, High Diffusion Cipher: Encryption and Error Correction in a Single Cryptographic Primitive, ACNS, pp.309-324, 2006.
DOI : 10.1007/11767480_21

M. Matyas, M. Peyravian, A. Roginsky, and N. Zunic, Reversible data mixing procedure for efficient public-key encryption, Computers & Security, vol.17, issue.3, pp.265-272, 1998.
DOI : 10.1016/S0167-4048(98)80340-4

R. J. Mceliece, A Public-Key Cryptosystem Based On Algebraic Coding Theory, Deep Space Network Progress Report, vol.44, pp.114-116, 1978.

R. J. Mceliece and D. V. Sarwate, On sharing secrets and Reed-Solomon codes, Communications of the ACM, vol.24, issue.9, pp.583-584, 1981.
DOI : 10.1145/358746.358762

N. Metropolis and S. Ulam, The Monte Carlo Method, Journal of the American Statistical Association, vol.44, issue.247, pp.335-341, 1949.
DOI : 10.1080/01621459.1949.10483310

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.
DOI : 10.1109/GLOCOM.2005.1577850

N. Miladinovic and M. Fossorier, Generalized LDPC codes and generalized stopping sets, IEEE Transactions on Communications, vol.56, issue.2, pp.201-212, 1974.
DOI : 10.1109/TCOMM.2008.041077

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

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, 2004.
DOI : 10.1007/978-3-540-30493-7_10

C. Neumann, V. Roca, A. Francillon, and D. Furodet, Impacts of packet scheduling and packet loss distribution on FEC Performances, Proceedings of the 2005 ACM conference on Emerging network experiment and technology , CoNEXT'05, pp.166-176, 2005.
DOI : 10.1145/1095921.1095944

URL : https://hal.archives-ouvertes.fr/inria-00000146

N. Fips, 180-2, Secure Hash Standard, Federal Information Processing Standard (FIPS), publication 180-2, 2002.

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

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, G. Liva, M. Varrella, B. Matuz, and M. Chiani, Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC. ArXiv e-prints, 2008.

E. Paolini, B. Matuz, G. Liva, and M. Chiani, Pivoting algorithms for maximum likelihood decoding of LDPC codes over erasure channels. Global Telecommunications Conference, 2009.

H. D. Pfister, I. Sason, and R. Urbanke, Capacity-Achieving Ensembles for the Binary Erasure Channel with Bounded Complexity, Fourth ETH?Technion Meeting on Information Theory and Communications, 2004.

H. Pishro-nik and F. Fekri, On decoding of low-density parity-check codes over the binary erasure channel. Information Theory, IEEE Transactions on, vol.50, issue.3, pp.439-454, 2004.

J. S. Plank, A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems, 1996.

G. and R. Redinbo, Fault-Tolerant Decoders for Cyclic Error-Correcting Codes, IEEE Transactions on Computers, vol.36, issue.1, pp.47-63, 1987.
DOI : 10.1109/TC.1987.5009448

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

Y. Remion, Décomposition LU « incrémentale » d'une matrice régulière, 2004.

T. J. Richardson and R. L. Urbanke, Efficient encoding of low-density parity-check codes. Information Theory, IEEE Transactions on, vol.47, issue.2, pp.638-656, 2001.

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, pp.619-637, 2001.
DOI : 10.1109/18.910578

R. L. Rivest, A. Shamir, and L. M. Adelman, A method for obtaining digital signatures and public-key cryptosystems, 1977.

R. L. Rivest, The MD5 message-digest algorithm, Internet Request for Comments, 1321.
DOI : 10.17487/rfc1321

L. Rizzo, Effective erasure codes for reliable computer communication protocols Roca and C. Neumann. Design, evaluation and comparison of four large block FEC codecs, LDPC, LDGM, LDGM staircase and LDGM triangle, ACM Computer Communication Review, vol.27, issue.2, 1997.

V. Roca, C. Neumann, and D. Furodet, Low Density Parity Check (LDPC) Forward Error Correction, IETF RMT Working Group, Request for Comments, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00781906

J. Roch and S. Varrette, Probabilistic certification of divide & conquer algorithms on global computing platforms Application to fault-tolerant exact matrix-vector product, Parallel Symbolic Compu- tation'07 (PASCO'07), 2007.

T. Roche, M. Cunche, and J. Roch, Algorithm-Based Fault Tolerance Applied to P2P Computing Networks, 2009 First International Conference on Advances in P2P Systems, 2009.
DOI : 10.1109/AP2PS.2009.30

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

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979.
DOI : 10.1145/359168.359176

C. E. Shannon, A Mathematical Theory of Communication, 1948.

A. Shokrollahi, Raptor codes, IEEE/ACM Transactions on Networking, vol.14, issue.SI, pp.2551-2567, 2006.

M. Lassen-soren-karp-richard-shokrollahi-amin, Systems and processes for decoding a chain reaction code through inactivation, US Patent, vol.7030785, 2006.

R. Singleton, Maximum distance q -nary codes. Information Theory, IEEE Transactions on, vol.10, issue.2, pp.116-118, 1964.

R. Smarandache and P. O. Vontobel, On regular quasicyclic LDPC codes from binomials, Information Theory ISIT 2004. Proceedings. International Symposium on, p.274, 2004.

A. Soro, M. Cunche, J. Lacan, and V. Roca, Erasure codes with a banded structure for hybrid Iterative-ML decoding. Global Telecommunications Conference, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00788318

A. Soro and J. Lacan, FNT-based Reed-Solomon erasure codes. CoRR, abs/0907, 1788.

J. Stone, M. Greenwald, C. Partridge, and J. Hughes, Performance of checksums and CRCs over real data, IEEE/ACM Transactions on Networking, vol.6, issue.5, pp.529-543, 1998.
DOI : 10.1109/90.731187

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

C. Studholme and I. Blake, Windowed erasure codes Information Theory, IEEE International Symposium on, pp.509-513, 2006.

C. Studholme and I. Blake, Random Matrices and Codes for the Erasure Channel, Algorithmica, vol.52, issue.2, 2008.
DOI : 10.1007/s00453-008-9192-0

R. and 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

R. and M. Tanner, On quasi-cyclic repeat-accumulate codes, Proc. 37th Allerton Conf. Communication, Control and Computing, pp.249-259, 1999.

R. Townsend, J. Weldon, and E. , Self-orthogonal quasi-cyclic codes. Information Theory, IEEE Transactions on, vol.13, issue.2, pp.183-195, 1967.

M. Cunche, C. Neumann, V. Roca, and J. Labouré, An Open-Source LDPC Large Block FEC Codec

A. Valembois, Detection and recognition of a binary linear code, Discrete Applied Mathematics, vol.111, issue.1-2, pp.199-218, 2001.
DOI : 10.1016/S0166-218X(00)00353-X

A. Robert, J. Van-de-geijn, and . Watts, Summa : scalable universal matrix multiplication algorithm. Concurrency -Practice and Experience, pp.255-274, 1997.

H. Weatherspoon and J. D. Kubiatowicz, Erasure Coding Vs. Replication: A Quantitative Comparison, Lecture Notes in Computer Science, vol.2429, pp.328-338, 2002.
DOI : 10.1007/3-540-45748-8_31

S. B. Bhargava and V. K. Wicker, Reed-Solomon Codes and Their Applications, 1994.

V. V. Zyablov and M. S. Pinsker, Decoding complexity of low-density codes for transmission in a channel with erasures, Probl. Peredachi Inf, vol.48, pp.18-28, 1974.