G. B. Agnew, T. Beth, R. C. Mullin, and S. A. Vanstone, Arithmetic operations inGF(2 m ), Journal of Cryptology, vol.35, issue.6, pp.3-13, 1993.
DOI : 10.1007/BF02620228

I. [. Ash, S. A. Blake, and . Vanstone, Low complexity normal bases, Discrete Applied Mathematics, vol.25, issue.3, pp.191-210, 1989.
DOI : 10.1016/0166-218X(89)90001-2

P. [. Augot, N. Charpin, and . Sendrier, Weights of some binary cyclic codes throughout the newton's identities, Eurocode' 90, 1990.

P. [. Augot, N. Charpin, and . Sendrier, Sur une classe de polynômes scindés de l'algèbre F 2 m, CRAS, vol.312, pp.649-751, 1991.

P. [. Augot, N. Charpin, and . Sendrier, Studying the locator polynomials of minimum weight codewords of BCH codes, IEEE Transactions on Information Theory, vol.38, issue.3, pp.960-973, 1992.
DOI : 10.1109/18.135638
URL : https://hal.archives-ouvertes.fr/hal-00723733

J. [. Assmus and . Key, Designs and their Codes, 1992.
DOI : 10.1017/CBO9781316529836

]. A. Alb56 and . Albert, Fundamental Concepts of Higher Algebra, 1956.

]. D. As93b, N. Augot, and . Sendrier, Idempotents and the BCH bound, IEEE Transaction on Information Theory, 1993.

[. Es and A. Valibouze, Calculs de tables de longueurs d'orbites de résolvantes et de groupes de galois. manuscrit, 1992.

]. E. Ber68 and . Berlekamp, Algebraic Coding Theory, 1968.

]. T. Ber91 and . Berger, Sur les groupes d'automorphismes des codes cycliquesétenduscycliquesétendus primitifs affine-invariants, 1991.

T. Beth, W. Geiselmann, and F. Meyer, Finding (good) normal bases in finite fields, Proceedings of the 1991 international symposium on Symbolic and algebraic computation , ISSAC '91, 1991.
DOI : 10.1145/120694.120717

. F. Bgm-+-93-]-i, X. H. Blake, R. C. Gao, S. A. Mullin, T. Vanstone et al., Applications of finite fields, 1993.

]. E. Bmvt78, R. J. Berlekamp, H. C. Maceliece, and . Van-tilborg, On the inherent intractability of certain coding problem, IEEE Transaction on Information Theory, vol.24, pp.384-386, 1978.

]. N. Bou84 and . Bourbaki, [Car] C. Carlet. The divisors of x 2 m + x of constant derivatives and degree 2 m ? 2, Histoire des Mathématiques. Masson, 1984.

B. [. Camion, A. Courteau, and . Monpetit, Coset Weight Enumerators of the Extremal Self-Dual Binary Codes of Length 32, Eurocode'92, 1992.
DOI : 10.1007/978-3-7091-2786-5_2

]. P. Cha87 and . Charpin, Codes cycliques affines invariants sous le groupe affine, 1987.

]. P. Cha90 and . Charpin, Codes cycliquesétenduscycliquesétendus affines-invariants et anticha??nesanticha??nes d'un ensemble partiellement ordonné, Discrete Mathematics, vol.80, pp.229-247, 1990.

E. [. Cantor and . Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683

S. [. Carlitz and . Uchiyama, Bounds for exponential sums. Duke mathematical journal, pp.37-41, 1957.

[. Dornstetter, Quelques résultats sur les codes BCH binaires en longueur 255, ENSTA stage report, 1982.

]. P. De-rooij and J. H. Van-lint, More on the minimum distance of cyclic codes, IEEE Transactions on Information Theory, vol.37, issue.1, pp.187-189, 1991.
DOI : 10.1109/18.61137

C. [. Dvornicich and . Traverso, Newton symmetric functions and the arithmetic of algebraically closed fields, Lecture Notes in Computer Science, vol.356, pp.216-224, 1987.
DOI : 10.1007/3-540-51082-6_79

B. [. Davenport and . Trager, Scratchpad's view of algebra I: Basic commutative algebra, 1992.
DOI : 10.1007/3-540-52531-9_122

]. R. Eli87 and . Mac-eliece, Finite Fields for the Computer Scientist and the Engineer, 1987.

[. Faugère, Résolution de systèmes d'´ equations algébriques avec GB, 1993.

P. [. Faugère, D. Gianni, T. Lazard, and . Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4
DOI : 10.1006/jsco.1993.1051

]. F. Gan77 and . Gantmacher, The Theory of Matrices, 1977.

S. [. Geddes, G. Czapor, and . Labahn, Algorithms for Computer Algebra, 1992.
DOI : 10.1007/b102438

A. Girard, Invention nouvelle en algèbre

]. A. Gmn-+-91, T. Giovini, G. Mora, L. Niesi, C. Robbiano et al., One sugar cube, please, or selection strategies in the Buchberger algorithm, Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991.

. J. Gs, B. Grabmeier, and . Scheerhorn, Finite fields in axiom

D. Richard, R. S. Jenks, and . Sutor, Axiom, the Scientific Computation System, 1992.

]. T. Kas69 and . Kasami, Weight distribution of Bose-Chaudhuri-Hocquenghem codes, Combinatorial Mathematic and its applications, pp.335-357, 1969.

S. [. Kasami and . Lin, Some results on the minimum weight of primitive BCH codes (Corresp.), IEEE Transactions on Information Theory, vol.18, issue.6, pp.824-825, 1972.
DOI : 10.1109/TIT.1972.1054903

S. [. Kasami, W. W. Lin, and . Peterson, Some results on cyclic codes which are invariant under the affine group and their applications, Information and Control, vol.11, issue.5-6, pp.475-496, 1967.
DOI : 10.1016/S0019-9958(67)90691-2

S. [. Kasami, W. W. Lin, and . Peterson, New generalizations of the Reed-Muller codes--I: Primitive codes, IEEE Transactions on Information Theory, vol.14, issue.2, pp.189-199, 1968.
DOI : 10.1109/TIT.1968.1054127

]. D. Knu81 and . Knuth, The Art of Computer Programming, 1981.

]. A. Las86 and . Lascoux, Suites récurrentes linéaires, Advances in Applied Mathematics, vol.7, pp.228-235, 1986.

D. Lazard, Systems of algebraic equations (algorithms and complexity), Proceedings of Cortona Conference, 1993.

. [. Levy-dit-vehel, On Duals of Binary Primitive BCH Codes, Eurocode'92, Lecture Notes in Computer Science, 1992.
DOI : 10.1007/978-3-7091-2786-5_5
URL : https://hal.archives-ouvertes.fr/inria-00074836

]. H. Len91 and . Lenstra, Finding isomorphisms between finite fields, Mathematics of Computation, pp.329-347, 1991.

]. J. Leo88 and . Leon, A probabilistic algorithm for computing minimum weights of large error-correcting codes, IEEE Transaction on Information Theory, vol.34, issue.5, pp.1354-1359, 1988.

H. [. Lidl and . Niederreiter, Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications, 1983.

[. Matsumoto and H. Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Advances In Cryptology, Eurocrypt'88, pp.419-453, 1988.
DOI : 10.1007/3-540-45961-8_39

]. M. Mig89 and . Mignotte, Mathématiques pour le calcul formel, 1989.

R. C. Mullin, I. M. Onyszchuk, S. A. Vanstone, and R. M. Wilson, Optimal normal bases in GF(p n ), Discrete Applied Mathematics, pp.149-161, 1988.
DOI : 10.1016/0166-218x(88)90090-x
URL : http://doi.org/10.1016/0166-218x(88)90090-x

T. [. Massey and . Schaub, Linear complexity in coding theory, Lecture Notes in Computer Science, issue.311, 1988.
DOI : 10.1007/3-540-19368-5_2

P. Ozello, Calcul exact des formes de Jordan et de Frobenius d'une matrice, 1987.
URL : https://hal.archives-ouvertes.fr/tel-00323705

E. [. Peterson and . Weldon-jr, Error-Correcting Codes, 1986.

]. C. Roo82 and . Roos, A generalization of the BCH bound for cyclic codes, including the hartmann-tzeng bound, Journal of Combinatorial Theory, vol.33, pp.229-232, 1982.

]. C. Roo83 and . Roos, A new lower bound for the minimum distance of a cyclic code, IEEE Transaction on Information Theory, vol.29, issue.3, pp.330-332, 1983.

]. N. Sen91 and . Sendrier, Codes CorrecteursàCorrecteurs`Correcteursà Haut Pouvoir de Correction, 1991.

R. Stong, Some asymptotic results on finite vector spaces, Advances in Applied Mathematics, vol.9, issue.2, pp.167-199, 1988.
DOI : 10.1016/0196-8858(88)90012-7

]. A. Val87 and . Valibouze, Fonctions symmétriques et changements de bases, Lecture Notes in Computer Science, vol.378, pp.323-332, 1987.

]. J. Van-lint, Introduction to Coding Theory, 1982.

J. H. Van-lint and R. M. Wilson, Binary cyclic codes generated by mira7 (Corresp.), IEEE Transactions on Information Theory, vol.32, issue.2, p.283, 1986.
DOI : 10.1109/TIT.1986.1057166

J. H. Van-lint and R. M. Wilson, On the minimum distance of cyclic codes, IEEE Transactions on Information Theory, vol.32, issue.1, pp.23-40, 1986.
DOI : 10.1109/TIT.1986.1057134

J. Von-zur-gathen and M. Giesbrecht, Constructing normal bases in finite fields, Journal of Symbolic Computation, vol.10, issue.6, pp.547-570, 1990.
DOI : 10.1016/S0747-7171(08)80158-7

]. D. Wee90 and . Weeks, Embarrassingly parallel algorithms for algebraic number arithmetic ? and some less trivial issues, Computer Algebra and Parallelism, number 584 in Lecture Notes in Computer Science, pp.63-70, 1990.

]. J. Wil92 and . Wilkinson, The Algebraic Eigenvalue Problem, 1992.

N. [. Mac-williams and . Sloane, The Theory of Error Correcting Codes, 1986.