✦ LIBER ✦

Bounds for Exponential Sums over Finite Fields

✍ Scribed by V. Gillot

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 431 KB
Volume: 1
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1995.1033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Lower Bounds for Incomplete Character

On Lower Bounds for Incomplete Character Sums over Finite Fields

✍ Ferruh Özbudak 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 290 KB

The purpose of this paper is to extend results of Stepanov (1980;1994) about lower bounds for incomplete character sums over a prime finite field F p to the case of arbitrary finite field F q .

Exponential Sums for Symmetric Matrices

Exponential Sums for Symmetric Matrices in a Finite Field

✍ John H. Hodges 📂 Article 📅 1955 🏛 John Wiley and Sons 🌐 English ⚖ 334 KB

Power Sums over Finite Subspaces of a Fi

Power Sums over Finite Subspaces of a Field

✍ Nigel P. Byott; Robin J. Chapman 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 134 KB

Let < be a "nite additive subgroup of a "eld K of characteristic p'0. We consider sums of the form S F (< : )" TZ4 (v# )F for h50 and 3 K. In particular, we give necessary and su$cient conditions for the vanishing of S F (<; ), in terms of the digit sum in the base-p expansion of h, in the case that

Newton Polygons of L Functions Associate

Newton Polygons of L Functions Associated with Exponential Sums of Polynomials of Degree Four over Finite Fields

✍ Shaofang Hong 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 226 KB

DEDICATED TO PROFESSOR CHAO KO ON THE OCCASION OF HIS 90TH BIRTHDAY Let F O be the "nite "eld of q elements with characteristic p and F O K its extension of degree m. Fix a nontrivial additive character of ). The corresponding ¸functions are de"ned by ¸( f, t)"exp( K S K ( f )tK/m). In this paper,

Algorithms for Exponentiation in Finite

Algorithms for Exponentiation in Finite Fields

✍ Shuhong Gao; Joachim Von zur gathen; Daniel Panario; Victor Shoup 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Gauss periods yield (self-dual) normal bases in finite fields, and these normal bases can be used to implement arithmetic efficiently. It is shown that for a small prime power q and infinitely many integers n, multiplication in a normal basis of F q n over Fq can be computed with O(n log n loglog n)

Hilbert Class Field Towers of Function F

Hilbert Class Field Towers of Function Fields over Finite Fields and Lower Bounds for A(q)

✍ Alexandre Temkine 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB

We obtain lower bounds for the asymptotic number of rational points of smooth algebraic curves over finite fields. To do this we construct infinite Hilbert class field towers with good parameters. In this way we improve bounds of Serre, Perret, and Niederreiter and Xing.