Enumeration of special sets of polynomials over finite fields (Q1290925): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:49, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Enumeration of special sets of polynomials over finite fields |
scientific article |
Statements
Enumeration of special sets of polynomials over finite fields (English)
0 references
27 March 2002
0 references
The author determines the number of square-free self-reciprocal polynomials (palindromes) of degree \(d\) over the finite field \(\mathbb{F}_q\). She also estimates the number of polynomials of degree \(d\) for which \(\gcd(f,\hat{f})=1\) or \(\gcd(f,f^\#)=1\), respectively, where \(\hat{f}\) is the monic reciprocal of \(f\) and \(f^\#\) the Frobenius conjugate polynomial of \(f\). As a consequence she shows that for large \(q\), the probability that \(\gcd(f,\hat{f})\) or \(\gcd(f,f^\#)\) is nontrivial is very small and a prefactorization of \(f\) by determining \(\gcd(f,\hat{f})\) or \(\gcd(f,f^\#)\) is inefficient.
0 references
finite fields
0 references
self-reciprocal polynomials
0 references
palindromes
0 references
Frobenius conjugate
0 references
factoring
0 references