An explicit tower of function fields over cubic finite fields and Zink’s lower bound

By Juscelino Bezerra, Arnaldo Garcia, Henning Stichtenoth. 2005

51 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/4604264385dbeda491602cb0bb43cd4f5e03f0fc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Henning Stichtenoth
2. Arnaldo Garcia

Citations in the corpus

• Towers of Function Fields over Non-prime Finite Fields (2012, methodology): “When l = q(3) is a cubic power one can choose the polynomial (see [1]) f(X,Y ) = Y (X +X − 1)−X(1− Y ) ∈ Fq3 [X,Y ] (6) to obtain a recursive tower over Fq3 with limit λ(F) ≥ 2(q(2) − 1)/(q + 2) ; this is the proof of Equation (5) above.”
• Handbook of Finite Fields (2013, unknown): “27 Example [4, 44] Over the field Fq with q = `, the equation Y ` − Y `−1 = 1−X +X−(`−1)”