✦ LIBER ✦

Enumeration of Special Sets of Polynomials over Finite Fields

✍ Scribed by Astrid Reifegerste

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 379 KB
Volume: 5
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1998.0231

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we consider squarefree polynomials over finite fields whose gcd with their reciprocal and Frobenius conjugate polynomial is trivial, respectively. Our focus is on the enumeration of these special sets of polynomials, in particular, we give the number of squarefree palindromes. These investigations make it possible to estimate the efficiency of the prefactorization of polynomials over finite fields based on such gcd calculations.

📜 SIMILAR VOLUMES

On the Value Sets of Special Polynomials

On the Value Sets of Special Polynomials over Finite Fields

✍ Abramo Hefez 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Factoring Polynomials over Special Finit

Factoring Polynomials over Special Finite Fields

✍ Eric Bach; Joachim von zur Gathen; Hendrik W. Lenstra Jr. 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 227 KB

We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which I (p) is built up from small prime factors; here I denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the cas

Enumerating Permutation Polynomials over

Enumerating Permutation Polynomials over Finite Fields by Degree

✍ Sergei Konyagin; Francesco Pappalardi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 85 KB

We prove an asymptotic formula for the number of permutations for which the associated permutation polynomial has degree smaller than q À 2. # 2002 Elsevier Science (USA)

On Value Sets of Polynomials over a Fini

On Value Sets of Polynomials over a Finite Field

✍ Wayne Aitken 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 254 KB

We study value sets of polynomials over a finite field, and value sets associated to pairs of such polynomials. For example, we show that the value sets (counting multiplicities) of two polynomials of degree at most d are identical or have at most q!(q!1)/d values in common where q is the number of

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.