✦ LIBER ✦

Number of Zeros of Diagonal Polynomials over Finite Fields

✍ Scribed by Ren Debin; Sun Qi; Yuan Pingzhi

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 98 KB
Volume: 7
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.2000.0309

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Solutions of Diagonal E

On the Number of Solutions of Diagonal Equations over a Finite Field

✍ Qi Sun; Ping-Zhi Yuan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 181 KB

In this paper, we give a reduction theorem for the number of solutions of any diagonal equation over a finite field. Using this reduction theorem and the theory of quadratic equations over a finite field, we also get an explicit formula for the number of solutions of a diagonal equation over a finit

A Class of Polynomials over Finite Field

A Class of Polynomials over Finite Fields

✍ Arnaldo Garcia; Henning Stichtenoth 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Generalizing the norm and trace mappings for % O P /% O , we introduce an interesting class of polynomials over "nite "elds and study their properties. These polynomials are then used to construct curves over "nite "elds with many rational points.

Groups of Permutation Polynomials over F

Groups of Permutation Polynomials over Finite Fields

✍ Richard M. Stafford 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Let F be a finite field. We apply a result of Thierry Berger (1996, Designs Codes Cryptography, 7, 215-221) to determine the structure of all groups of permutations on F generated by the permutations induced by the linear polynomials and any power map which induces a permutation on F.

Some Systems of Diagonal Equations over

Some Systems of Diagonal Equations over Finite Fields

✍ Jacques Wolfmann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 254 KB

By using results of coding theory, we give results on the number of solutions of some systems of diagonal equations over finite fields.

Counting Polynomials with Zeros of Given

Counting Polynomials with Zeros of Given Multiplicities in Finite Fields

✍ Jean-François Ragot 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 136 KB

We consider the set of polynomials in r indeterminates over a "nite "eld and with bounded degree. We give here a way to count the number of elements of some of its subsets, namely those sets de"ned by the multiplicities of their elements at some points of %P O . The number of polynomials having at l

The Factorization of Dickson Polynomials

The Factorization of Dickson Polynomials over Finite Fields

✍ Wun-Seng Chou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Let T n (x, a) ʦ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the first kind or the second kind of degree n in the indeterminate x and with parameter a. We give a complete description of the factorization of T n (x, a) over GF(q).