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

DOI10.1016/J.FFA.2016.07.008zbMATH Open1360.14073arXiv1503.06591OpenAlexW2243833039MaRDI QIDQ324289FDOQ324289

Authors: Emmanuel Hallouin, Marc Perret 

Publication date: 10 October 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: 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 on an example, from the production process, to the theoretical study, using this functional criterion, of the parameters of the obtained potentially good tower.

Full work available at URL: https://arxiv.org/abs/1503.06591

Recommendations

• Recursive towers of curves over finite fields using graph theory
• scientific article; zbMATH DE number 2231485
• Towards a classification of recursive towers of function fields over finite fields
• Recursive towers of function fields over finite fields
• Graphs and recursively defined towers of function fields

zbMATH Keywords

finite fieldalgebraic curverational pointrecursive tower of algebraic curves

Mathematics Subject Classification ID

Classical hypergeometric functions, ({}_2F_1) (33C05) Paths and cycles (05C38) Rational points (14G05) Singularities of curves, local rings (14H20) Finite ground fields in algebraic geometry (14G15) Applications of hypergeometric functions (33C90)

Cites Work

• The on-line encyclopedia of integer sequences
• Towers of function fields over non-prime finite fields
• Title not available (Why is that?)
• On tame towers over finite fields
• Explicit towers of function fields over finite fields
• History of the theory of numbers. Vol. I: Divisibility and primality. Vol. II: Diophantine analysis. Vol. III: Quadratic and higher forms.
• Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
• On a problem of Garcia, Stichtenoth, and Thomas.
• Graphs and recursively defined towers of function fields
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• Recursive towers of curves over finite fields using graph theory
• Modular curves and coding theory: a survey
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• Title not available (Why is that?)

Cited In (6)

• Recursive towers of curves over finite fields using graph theory
• A modular interpretation of BBGS towers
• AN ASYMPTOTICALLY GOOD TOWER OF CURVES OVER THE FIELD WITH EIGHT ELEMENTS
• Recursive towers of function fields over finite fields
• Graphs and recursively defined towers of function fields
• Good recursive towers over prime fields exist

Uses Software

• OEIS

This page was built for publication: A graph aided strategy to produce good recursive towers over finite fields

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