Recursive towers of curves over finite fields using graph theory

From MaRDI portal



Abstract: We give a new way to study recursive towers of curves over a finite field, defined from a bottom curve Cun and a correspondence Cdeux on Cun.In particular, we study their asymptotic behavior. A close examination of singularities leads to a necessary condition for a tower to be asymptotically good. Then, spectral theory on a directed graph and considerations on the class of Cdeux in NS(CunimesCun) lead to the fact that, under some mild assumptions, a recursive tower which does not reach Drinfeld-Vladut bound cannot be optimal in Tsfasmann-Vladut sense. Results are applied to the Bezerra-Garcia-Stichtenoth tower along the paper for illustration.











This page was built for publication: Recursive towers of curves over finite fields using graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2801861)