A graph aided strategy to produce good recursive towers over finite fields

We propose a systematic method to produce potentially good recursive towers over finite fields. The graph point of view, so as some magma and sage computations are used in this process. We also establish some theoretical functional criterion ensuring the existence of many rational points on a recursive tower. Both points are illustrated by an example, from the production process, to the theoretical study.     

Algebraic curves and maximal arcs

A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set of the Desarguesian plane PG(2,q) is obtained. The case where is a maximal (k,n)-arc is considered in greater depth. Research supported by the Italian Ministry MURST, Strutture geometriche, combinatoria e loro applicazioni.     

Maximality of Ciani curves over finite fields

In this paper, we will study Ciani curves in characteristic $p\ge 3$, in particular their standard forms $C:x^4+y^4+z^4+r{x}^2{y}^2+s{y}^2{z}^2+t{z}^2{x}^2=0$. It is well-known that any Ciani curve is a non-hyperelliptic curve of genus 3, and its Jacobian variety is isogenous to the product of three elliptic curves. As a main result, we will show that if C is superspecial, then $r,s,t$ belong to ${\mathbb{F}}_{p^2}$ and C is maximal or minimal over ${\mathbb{F}}_{p^2}$. Moreover, in this case we will provide a simple criterion in terms of $r,s,t,p$ that tells whether C is maximal (resp. minimal) over ${\mathbb{F}}_{p^2}$.     

On generalizations of Fermat curves over finite fields and their automorphisms

Let 𝒳 be an irreducible algebraic curve defined over a finite field 𝔽_q of characteristic p>2. Assume that the 𝔽_q-automorphism group of 𝒳 admits a subgroup isomorphic to the direct product of two cyclic groups C_m and C_n of orders m and n prime to p, such that both quotient curves 𝒳∕C_n and 𝒳∕C_m are rational. In this paper, we provide a complete classification of such curves as well as a characterization of their full automorphism groups.     

Optimal curves of low genus over finite fields

We investigate maximal and minimal curves of genus 4 and 5 over finite fields with discriminant −11 and −19. As a result the Hasse–Weil–Serre bound is improved.     

Near-MDS codes arising from algebraic curves

Every elliptic quartic Γ₄ of PG(3,q) with nGF(q)-rational points provides a near-MDS code C of length n and dimension 4 such that the collineation group of Γ₄ is isomorphic to the automorphism group of C. In this paper we assume that GF(q) has characteristic p>3. We classify the linear collineation groups of PG(3,q) which can preserve an elliptic quartic of PG(3,q). Also, we prove for q?113 that if the j-invariant of Γ₄ does not disappear, then C cannot be extended in a natural way by adding a point of PG(3,q) to Γ₄.     

Fluctuations in the number of points on smooth plane curves over finite fields

In this note, we study the fluctuations in the number of points on smooth projective plane curves over a finite field Fq as q is fixed and the genus varies. More precisely, we show that these fluctuations are predicted by a natural probabilistic model, in which the points of the projective plane impose independent conditions on the curve. The main tool we use is a geometric sieving process introduced by Poonen (2004) [8].     

Explicit constructions of separating hash families from algebraic curves over finite fields

Let X be a set of order n and Y be a set of order m. An (n,m,{w ₁, w ₂})-separating hash family is a set of N functions from X to Y such that for any with , |X ₁| = w ₁ and |X ₂| = w ₂, there exists an element such that . In this paper, we provide explicit constructions of separating hash families using algebraic curves over finite fields. In particular, applying the Garcia–Stichtenoth curves, we obtain an infinite class of explicitly constructed (n,m,{w ₁,w ₂})–separating hash families with for fixed m, w ₁, and w ₂. Similar results for strong separating hash families are also obtained. As consequences of our main results, we present explicit constructions of infinite classes of frameproof codes, secure frameproof codes and identifiable parent property codes with length where n is the size of the codes. In fact, all the above explicit constructions of hash families and codes provide the best asymptotic behavior achieving the bound , which substantially improve the results in [ 8, 15, 17] give an answer to the fifth open problem presented in [11].     

Zeta-functions of curves of genus 3 over finite fields

In this paper, we determine zeta-functions of some curves of genus 3 over finite fields by gluing three elliptic curves based on Xing＇s research, and the examples show that there exists a maximal curve of genus 3 over F49.     

Lattices from elliptic curves over finite fields

In their well known book [6] Tsfasman and Vladut introduced a construction of a family of function field lattices from algebraic curves over finite fields, which have asymptotically good packing density in high dimensions. In this paper we study geometric properties of lattices from this construction applied to elliptic curves. In particular, we determine the generating sets, conditions for well-roundedness and a formula for the number of minimal vectors. We also prove a bound on the covering radii of these lattices, which improves on the standard inequalities.     

Zeta functions of trinomial curves and maximal curves

We determine the zeta functions of trinomial curves in terms of Jacobi sums, and obtain an explicit formula of the genus of a trinomial curve over a finite field, and we study the conditions for this curve to be a maximal curve over a finite field.