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

A classification of algorithms for multiplying polynomials of small degree over finite fields

โœ Scribed by Amir Averbuch; Nader H Bshouty; Michael Kaminski

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
620 KB
Volume
13
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Class of Polynomials over Finite Field
A Class of Polynomials over Finite Fields
โœ 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.

The Number of Permutation Polynomials of
The Number of Permutation Polynomials of a Given Degree Over a Finite Field
โœ 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

On Value Sets of Polynomials over a Fini
On Value Sets of Polynomials over a Finite Field
โœ Wayne Aitken ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

We study value sets of polynomials over a finite field, and value sets associated to pairs of such polynomials. For example, we show that the value sets (counting multiplicities) of two polynomials of degree at most d are identical or have at most q!(q!1)/d values in common where q is the number of