Mécanismes de fiabilisation pro-actifs - ISAE

More documents

Recommendations

Info

124 Bibliographie[70] I. S. Reed, A class of multiple-error-correcting codes and the decoding scheme.IEEE Transactions on Information Theory, vol. 4, pp. 3849, 1954. 85[71] D. E. Muller, Application of boolean algebra to switching circuit design and toerror detection. IEEE Transactions on Computers, vol. 3, pp. 612, 1954. 85[72] I. Dumer and K. Shabunov, Soft-decision decoding of reed-muller codes : recursivelists. IEEE Transactions on Information Theory, vol. 52, pp. 12601266,2006. 85[73] C. Hänle, Feasibility study of erasure correction for multicast le distributionusing the network simulator ns-2, IEEE Military Communications Conference,vol. 3, pp. 12601266, 1998. 85[74] M. Plotkin, Binary codes with specied minimum distance, IRE Transactionson Information Theory, vol. 6, pp. 445450, 1960. 86[75] T. Hehn, O. Milenkovic, S. Laendner, and J. B. Huber, Permutation decodingand the stopping redundancy hierarchy of cyclic and extended cyclic codes. IEEETransactions on Information Theory, no. 12, pp. 53085331, 2008. 90[76] http://personnel.isae.fr/jerome-lacan/reed-muller-erasure-codes.html. 95[77] V. Strassen, Die berechnungskomplexität von elementarsymmetrischen funktionenund von interpolationskoezienten, j-NUM-MATH, vol. 20, no. 3, pp. 238251, jun 1973. 98[78] J. M. Pollard, The Fast Fourier Transform in a nite eld, Mathematics ofComputation, vol. 25, no. 114, pp. 365374, Apr. 1971. 98, 99[79] J. M. Cooley and J. W. Tukey, An algorithm for the machine calculation ofcomplex fourier series, Math. Comp., vol. 19, p. 297, 1965. 99[80] A. Karatsuba and Y. Oman, Multiplication of multidigit numbers on automata,Soviet Physics Doklady, vol. 7, pp. 595596, 1963. 103[81] A. L. Toom, The complexity of a scheme of functional elements realizingthemultiplication of integers, Translations of Soviet Mathematics SSSR 4, 1963.103[82] S. A. Cook, On the minimum computation time of functions, Ph.D. dissertation,Department of Mathematics, Harvard University, 1966. 103[83] A. Schonhage and V. Strassen, Schnelle multiplikation grosser zahlen, Computing,vol. 7, pp. 281292, 1971. 103[84] T. Mulders, On short multiplications and divisions, AAECC, vol. 11, pp. 6988,2000. 106[85] G. Hanrot and P. Zimmermann, A long note on Mulders' short product,Journal of Symbolic Computation, vol. 37, pp. 391401, 2004. [Online].Available : http://hal.inria.fr/inria-00100069/en/ 106[86] The GNU MP Bignum Library. [Online]. Available : http://gmplib.org/ 114
Bibliographie 125[87] S. Li and J. Zhang, Area-delay ecient parallel architecture for fermat numbertransform, IEICE Electronics Express, vol. 6, no. 8, pp. 449455, 2009. 114[88] FNT-based codes. [Online]. Available : http://pagespro.isae.fr/jerome-lacan/114[89] The OpenFEC project. [Online]. Available : http://www.openfec.org/ 114
Page 1 and 2:
THÈSEEn vue de l'obtention duDOCTO
Page 4 and 5:
iiannée de thèse : Julien, Paul,
Page 6 and 7:
ivTable des matières4.3 Analyse th
Page 8 and 9:
viTable des gures4.2 Matrice de par
Page 11 and 12:
Chapitre 1IntroductionLes thèses l
Page 13:
1.2. Organisation du document 3une
Page 16 and 17:
6 Chapitre 2. Etat de l'art et prin
Page 18 and 19:
8 Chapitre 2. Etat de l'art et prin
Page 20 and 21:
10 Chapitre 2. Etat de l'art et pri
Page 22 and 23:
Page 24 and 25:
Page 26 and 27:
Page 28 and 29:
Page 30 and 31:
Page 32 and 33:
Page 34 and 35:
Page 36 and 37:
Page 38 and 39:
Page 40 and 41:
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
44 Chapitre 3. Modélisation d'un p
Page 56 and 57:
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 81 and 82:
Chapitre 4Codes à eacements à dé
Page 83 and 84: 4.2. Construction des codes à matr
Page 89 and 90: 4.3. Analyse théorique 79décalage
Page 91 and 92: 4.4. Résultats obtenus 81 Les code
Page 93 and 94: 4.5. Conclusion 83véritable comple
Page 95 and 96: Chapitre 5Codes de Reed-Muller pour
Page 97 and 98: 5.2. Présentation du code 87Une m
Page 99 and 100: 5.2. Présentation du code 89Figure
Page 101 and 102: 5.2. Présentation du code 91invers
Page 103 and 104: 5.3. Résultats de simulation 93Fig
Page 105: 5.4. Conclusion 955.4 ConclusionNou
Page 108 and 109: 98 Chapitre 6. Codes à eacements M
Page 110 and 111: 100 Chapitre 6. Codes à eacements
Page 126 and 127: 116 Chapitre 7. Conclusion et persp
Page 129 and 130: Bibliographie[1] C. E. Shannon, A m
Page 131 and 132: Bibliographie 121[32] ETSI IP Datac
Page 133: Bibliographie 123[55] E. N. Gilbert
show all

Mécanismes de fiabilisation pro-actifs - ISAE

Create successful ePaper yourself

Delete template?

Save as template?