Counting irreducible factors of polynomials over a finite field, Discrete Mathematics, 112 (1993) 103-l 18. Let F,[X] denote a polynomial ring in an indeterminate X over a finite field IF,. Exact formulae are derived for (i) the number of polynomials of degree n in F,[X] with a specified number of i
β¦ LIBER β¦
Discriminants and the irreducibility of a class of polynomials in a finite field of arbitrary characteristic
β Scribed by Oscar Moreno
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 202 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Counting irreducible factors of polynomi
β
Arnold Knopfmacher; John Knopfmacher
π
Article
π
1993
π
Elsevier Science
π
English
β 728 KB
On the irreducibility of a class of poly
β
K GyΓΆry
π
Article
π
1982
π
Elsevier Science
π
English
β 844 KB
A Class of Polynomials over Finite Field
β
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.
On Polynomial Values of the Discriminant
β
B Brindza; Γ PintΓ©r; J VΓ©gsΕ
π
Article
π
1996
π
Elsevier Science
π
English
β 371 KB
The distribution of values of polynomial
β
Arnold Knopfmacher; John Knopfmacher
π
Article
π
1990
π
Elsevier Science
π
English
β 278 KB
The Distribution of Zeros of an Irreduci
β
Zhiyong Zheng
π
Article
π
1996
π
Elsevier Science
π
English
β 473 KB
Let f (x, y) be a polynomial defined over Z in two variables of total degree d 2, and let Vp=[(x, y) # C p : f(x, y)#0 (mod p)] for each prime p, where C p = [(x, y) # Z 2 : 0 x<p and 0 y<p]. In this paper, we show that if f (x, y) is absolutely irreducible modulo p for all sufficiently large p, the