✦ LIBER ✦

Rapid parallel calculation of degrees in a quotient ring of polynomials over a finite field

✍ Scribed by P. N. Golovanov; V. I. Solodovnikov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1987
Tongue: English
Weight: 355 KB
Volume: 42
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01137457

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A classification of algorithms for multi

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

✍ Amir Averbuch; Nader H Bshouty; Michael Kaminski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 620 KB

A Goldbach 3-primes theorem for polynomi

A Goldbach 3-primes theorem for polynomials of low degree over finite fields of characteristic 2

✍ Gove Effinger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

Bounds in the theory of polynomial rings

Bounds in the theory of polynomial rings over fields. A nonstandard approach

✍ L. van den Dries; K. Schmidt 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 809 KB