In this paper we give a deterministic construction for a Normal basis of Kf over K, where K' is
an abelian extension of finite degree n over some commutative, infinite field K. No particular …

On caracterise les ideaux principaux ni lpotents de plus grande dimension possible dans 1'algebre
IF [GI d'un groupe q abelien fini G (q= pS, p premier). On montre en outre, que ces …

A simple deterministic algorithm to construct a normal basis of GF(q/sup n/) over GF(q) (q=p/sup
r/, p prime) is given. When p=2, the authors deduce a (self complementary normal-SCN) …

We deal with codes which are ideals in a finite abelian group algebra A, over finite field. We
give constructive proofs to obtain n-variables polynomial codes. In particular, we give an …

Les récentes études de publics le confirment, on va au musée en 2012 avec la même envie
d’éducation qu’on y allait à la fin des années quatre-vingt-dix : pour apprendre, se cultiver, …

Constructing normal bases of GF(q n ) over GF (q) can be done by probabilistic methods as
well as deterministic ones. In the following paper we consider only deterministic constructions…

… Poli "Important algebraic calculations for n variable polynomial codes" … Poli "Codes
dans certaines alg6bres modulaires" Th6se d'Etat,Univ. P.Sabatier,Toulouse,F,1978. … Poli …

We propose experimental results, obtained from an algorithm for factorising polynomial over
large prime fields GF (p). Experimental running times are compared with those needed …

In this paper we give necessary and sufficient conditions for the existence of self dual 2k
circulant codes. We specify the number of such codes when these conditions are satisfied. We …

The AAECC symposium was started in June 1983 by Alain Poli (Toulouse), who, together
with R. Desq, D. Lazard, and P. Camion, organized the first conference. The meaning of the …