Regular orbits for projective orthogonal groups over finite fields of odd characteristic

In this paper we prove that the projective orthogonal groups over finite fields of odd characteristic acting on the set of points of the corresponding quadrics, have regular orbits apart from a finite number of explicitly listed exceptions occurring in dimension 2 and 3.Lavoro eseguito nell'ambito dei gruppi nazionali del C.N.R. (G.N.S.A.G.A.) e del finanziamento del M.P.I.     

Group codes over fields are asymptotically good

Group codes are right or left ideals in a group algebra of a finite group over a finite field. Following the ideas of a paper on binary group codes by Bazzi and Mitter in 2006, we prove that group codes over finite fields of any characteristic are asymptotically good.     

Planar functions over fields of characteristic two

Classical planar functions are functions from a finite field to itself and give rise to finite projective planes. They exist however only for fields of odd characteristic. We study their natural counterparts in characteristic two, which we also call planar functions. They again give rise to finite projective planes, as recently shown by the second author. We give a characterisation of planar functions in characteristic two in terms of codes over \(\mathbb {Z}_{4}\) . We then specialise to planar monomial functions f(x)=cx ^t and present constructions and partial results towards their classification. In particular, we show that t=1 is the only odd exponent for which f(x)=cx ^t is planar (for some nonzero c) over infinitely many fields. The proof techniques involve methods from algebraic geometry.     

Cosine transforms over fields of characteristic 2

In this paper, we introduce cosine transforms over fields of characteristic 2. Our approach complements previous definitions of finite field trigonometric transforms, which only hold for fields whose characteristic is an odd prime. Besides introducing some new concepts related to trigonometry in finite fields, we discuss the eigenstructure and other important properties of the proposed transforms.     

Windmill polynomials over fields of characteristic two

Chambers andSmeets [3] have designed a windmill arrangement of linear feedback shift registers (LFSRs) to generate pn-sequences overGF(2) with high speed. When the windmill hasv vanes, the associated minimal feedback polynomial (having degreen, relatively prime tov) can be taken to have the shapef ₁(x ^v )+x ⁿ f ₂(x ^–v ), where the polynomialsf ₁ andf ₂ have degree [n/v]. Their numerical evidence, whenv is divisible by 4, suggests that, surprisingly, there areno such windmill polynomials which are irreducible ifn±3 (mod 8), while about twice as many irreducible and primitive windmill polynomials as they expected occur ifn±1 (mod 8). A discussion of this behaviour is presented here with proofs. The brief explanation is that the Galois group of the underlying generic windmill polynomial overGF (4) is equal to the alternating groupA _n .     

Abelian varieties over fields of finite characteristic

The aim of this paper is to extend our previous results about Galois action on the torsion points of abelian varieties to the case of (finitely generated) fields of characteristic 2.     

Generalized Gabidulin codes over fields of any characteristic

We generalize Gabidulin codes to a large family of fields, non necessarily finite, possibly with characteristic zero. We consider a general field extension and any automorphism in the Galois group of the extension. This setting enables one to give several definitions of metrics related to the rank-metric, yet potentially different. We provide sufficient conditions on the given automorphism to ensure that the associated rank metrics are indeed all equal and proper, in coherence with the usual definition from linearized polynomials over finite fields. Under these conditions, we generalize the notion of Gabidulin codes. We also present an algorithm for decoding errors and erasures, whose complexity is given in terms of arithmetic operations. Over infinite fields the notion of code alphabet is essential, and more issues appear that in the finite field case. We first focus on codes over integer rings and study their associated decoding problem. But even if the code alphabet is small, we have to deal with the growth of intermediate values. A classical solution to this problem is to perform the computations modulo a prime ideal. For this, we need study the reduction of generalized Gabidulin codes modulo an ideal. We show that the codes obtained by reduction are the classical Gabidulin codes over finite fields. As a consequence, under some conditions, decoding generalized Gabidulin codes over integer rings can be reduced to decoding Gabidulin codes over a finite field.     

Monomial Hopf algebras over fields of positive characteristic

In this paper, we study the structures of monomial Hopf algebras over a field of positive characteristic. A necessary and sufficient condition for the monomial coalgebra Cd(n) to admit Hopf structures is given here, and if it is the case, all graded Hopf structures on Cd(n) are completely classified. Moreover, we construct a Hopf algebras filtration on Cd(n) which will help us to discuss a conjecture posed by Andruskiewitsch and Schneider. Finally combined with a theorem by Montgomery, we give the structure theorem for all monomial Hopf algebras.     

一类幂零矩阵幂零指标的特征

设(L, ,·)是一个incline. 本文给出了一个incline上幂零矩阵幂零指标的特征.其结果改进了文[4]中的相应结论.     

Binomial permutations over finite fields with even characteristic

Designs, Codes and Cryptography - In this paper, we study binomials having the form $$x^r(a+x^{3(q-1)})$$ over the finite field $$\mathbb {F}_{q^2}$$ with $$q=2^m$$ , and determine all the...     

Generalized inverses of matrices over fields of characteristic two

For F a field of characteristic two, the problem of determining which m×n matrices of rank r have normalized generalized inverses and which have pseudoinverses is solved. For F_q a finite field of characteristic two, both the number of m×n matrices of rank r over F which have normalized generalized inverses and the number of m×n matrices of rank r over F_q which have pseudoinverses are determined.     

Abelian varieties over cyclotomic fields with good reduction everywhere

 For every conductor f{1,3,4,5,7,8,9,11,12,15} there exist non-zero abelian varieties over the cyclotomic field Q(ζ _f ) with good reduction everywhere. Suitable isogeny factors of the Jacobian variety of the modular curve X ₁ (f) are examples of such abelian varieties. In the other direction we show that for all f in the above set there do not exist any non-zero abelian varieties over Q(ζ _f ) with good reduction everywhere except possibly when f=11 or 15. Assuming the Generalized Riemann Hypothesis (GRH) we prove the same result when f=11 and 15. Received: 19 April 2001 / Revised version: 21 October 2001 / Published online: 10 February 2003