International audienceWe 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
Thesis (PhD (Mathematical Sciences))--University of Stellenbosch, 2007.Explicit towers of algebraic ...
We introduce the notion of the dual tower of a recursive tower of function fields over a finite fiel...
In this paper we study the problem of constructing non-trivial subtowers and supertowers of recursiv...
International audienceWe propose a systematic method to produce potentially good recursive towers ov...
International audienceWe propose a systematic method to produce potentially good recursive towers ov...
International audienceWe give a new way to study recursive towers of curves over a finite field, def...
International audienceWe give a new way to study recursive towers of curves over a finite field, def...
International audienceWe give a construction and equations for good recursive towers over any finite...
International audienceWe give a construction and equations for good recursive towers over any finite...
AbstractIn this paper we state and explore a connection between graph theory and the theory of recur...
We give a construction and equations for good recursive towers over any finite field $\mathbf{F}_q$ ...
AbstractIn this paper we derive “normal forms” for the defining equations of recursive towers of fun...
We illustrate a general technique to construct towers of fields producing high order elements in Fq2...
In 1995 Garcia and Stichtenoth gave explicit constructions of sequences of function fields over the ...
AbstractFinite field towers GF(qP) are considered, where P=pn11Pn22··· pntt and all primes pi are di...
Thesis (PhD (Mathematical Sciences))--University of Stellenbosch, 2007.Explicit towers of algebraic ...
We introduce the notion of the dual tower of a recursive tower of function fields over a finite fiel...
In this paper we study the problem of constructing non-trivial subtowers and supertowers of recursiv...
International audienceWe propose a systematic method to produce potentially good recursive towers ov...
International audienceWe propose a systematic method to produce potentially good recursive towers ov...
International audienceWe give a new way to study recursive towers of curves over a finite field, def...
International audienceWe give a new way to study recursive towers of curves over a finite field, def...
International audienceWe give a construction and equations for good recursive towers over any finite...
International audienceWe give a construction and equations for good recursive towers over any finite...
AbstractIn this paper we state and explore a connection between graph theory and the theory of recur...
We give a construction and equations for good recursive towers over any finite field $\mathbf{F}_q$ ...
AbstractIn this paper we derive “normal forms” for the defining equations of recursive towers of fun...
We illustrate a general technique to construct towers of fields producing high order elements in Fq2...
In 1995 Garcia and Stichtenoth gave explicit constructions of sequences of function fields over the ...
AbstractFinite field towers GF(qP) are considered, where P=pn11Pn22··· pntt and all primes pi are di...
Thesis (PhD (Mathematical Sciences))--University of Stellenbosch, 2007.Explicit towers of algebraic ...
We introduce the notion of the dual tower of a recursive tower of function fields over a finite fiel...
In this paper we study the problem of constructing non-trivial subtowers and supertowers of recursiv...