๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The number of irreducible polynomials of a given form over a finite field

โœ Scribed by S. A. Stepanov


Publisher
SP MAIK Nauka/Interperiodica
Year
1987
Tongue
English
Weight
307 KB
Volume
41
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The Number of Permutation Polynomials of
โœ Pinaki Das ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 139 KB

We relate the number of permutation polynomials in F q ยฝx of degree d q ร€ 2 to the solutions รฐx 1 ; x 2 ; . . . ; x q รž of a system of linear equations over F q , with the added restriction that x i =0 and x i =x j whenever i=j. Using this we find an expression for the number of permutation polynomi

Counting irreducible factors of polynomi
โœ Arnold Knopfmacher; John Knopfmacher ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 728 KB

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