Entry details for q = 32 = 9, g = 6
Table About Recent changes References
Username
Password
Log in Register

Lower bound Nmin = 35

Submitted by Gerrit Oomens
Date 01/01/1900
Reference H. Niederreiter, C. P. Xing
A general method of constructing global function fields with many rational places
In: Algorithmic Number Theory (Portland 1998), Lecture Notes in Comp. Science 1423, Springer, Berlin, 1998, p. 555-566.
Comments
Tags Drinfeld modules of rank 1

User comments

No comments have been made.

Upper bound Nmax = 38

Submitted by Everett Howe
Date 04/14/2010
Reference Everett W. Howe and Kristin E. Lauter
New methods for bounding the number of points on curves over finite fields
Geometry and Arithmetic (C. Faber, G. Farkas, and R. de Jong, eds.), European Mathematical Society, 2012, pp. 173–212
Comments
A real Weil polynomial we don't know how to eliminate: (x + 5) * (x + 6)^3 * (x^2 + 5*x + 3)
Tags None

User comments

No comments have been made.