Mécanismes de fiabilisation pro-actifs - ISAE

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