A graph aided strategy to produce good recursive towers over finite fields
From MaRDI portal
Publication:324289
DOI10.1016/j.ffa.2016.07.008zbMath1360.14073arXiv1503.06591OpenAlexW2243833039MaRDI QIDQ324289
Marc Perret, Emmanuel Hallouin
Publication date: 10 October 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.06591
Paths and cycles (05C38) Rational points (14G05) Finite ground fields in algebraic geometry (14G15) Applications of hypergeometric functions (33C90) Singularities of curves, local rings (14H20) Classical hypergeometric functions, ({}_2F_1) (33C05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Towers of Function Fields over Non-prime Finite Fields
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- On tame towers over finite fields
- The on-line encyclopedia of integer sequences
This page was built for publication: A graph aided strategy to produce good recursive towers over finite fields