Results 271 to 280 of about 12,820,749 (293)
Some of the next articles are maybe not open access.

Polynomials Over Finite Fields

1992
The first step of modern algorithms of factorization of polynomials with integer coefficients consists in factorizing their image modulo some prime number. This is the reason why, in this chapter, we study the factorization of polynomials over finite fields. Most of the results of this theory were developed by E.R. Berlekamp.
openaire   +1 more source

Polynomials over Finite Fields

2002
In all that follows F will denote a finite field with q elements. The model for such a field is ℤ/pℤ, where p is a prime number. This field has p elements. In general the number of elements in a finite field is a power of a prime, q = p f . Of course, p is the characteristic of F.
openaire   +1 more source

Construction of Irreducible Polynomials over Finite Fields

2010
The aim of this paper is to present an explicit construction of families of irreducible polynomials over finite fields by applying a polynomial composition method.
openaire   +1 more source

Polynomial automorphisms over finite fields

2009
Every automorphism of the polynomial algebra in \(n\) variables over a field \(k\) induces a bijection of the set \(k^n\) of \(n\)-tuples and in this way the automorphism group maps in the group of all bijections of \(k^n\). It is easy to see that for infinite fields very few bijections are images of automorphisms.
openaire   +2 more sources

Polynomials Over a Finite Field

Journal of the London Mathematical Society, 1965
openaire   +2 more sources

Reversed Dickson Polynomials Over Finite Fields

Finite Fields and Their Applications, 2009
Xiang-Dong Hou   +2 more
exaly  

Two Classes of Permutation Polynomials Over Finite Fields

Journal of Combinatorial Theory - Series A, 2011
Xiang-Dong Hou
exaly  

Home - About - Disclaimer - Privacy