Constructing irreducible polynomials with prescribed level curves over finite fields
We use Eisenstein's irreducibility criterion to prove that there exists an absolutely irreducible polynomial P(X,Y)∈GF(q)[X,Y] with coefficients in the finite field GF(q) with q elements, with prescribed level curves Xc:={(x,y)∈GF(q)2|P(x,y)=c}.
Saved in:
Main Author: | Mihai Caragiu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2001-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/S0161171201011309 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On permutation polynomials over finite fields
by: R. A. Mollin, et al.
Published: (1987-01-01) -
On some permutation polynomials over finite fields
by: Amir Akbary, et al.
Published: (2005-01-01) -
Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains
by: Hiebler, Moritz, et al.
Published: (2023) -
Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains
by: Hiebler, Moritz, et al.
Published: (2024) -
On the Degree of the GCD of Random Polynomials over a Finite Field
by: Kui Liu, et al.
Published: (2021-01-01)