A recurrent construction of irreducible polynomials of fixed degree over finite fields
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0622
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A recurrent construction of irreducible polynomials of fixed degree over finite fields ; day:15 ; month:6 ; year:2020 ; pages:1-9
Applicable algebra in engineering, communication and computing ; (15.6.2020), 1-9
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00200-020-00439-7
- URN
-
urn:nbn:de:101:1-2020081223322948438465
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:48 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kyureghyan, Gohar M.
- Kyureghyan, Melsik K.
- SpringerLink (Online service)
Other Objects (12)
Constructing irreducible polynomials recursively with a reverse composition method
Irreducible polynomials over finite fields for coding and cryptography
Cyclotomic numerical semigroup polynomials with at most two irreducible factors
Low-Degree Approximation of Random Polynomials
A CHARACTERIZATION OF LOW DEGREE POLYNOMIALS
On decompositions of binary recurrent polynomials
Explicit upper bound for the average number of divisors of irreducible quadratic polynomials
Factorization of quaternionic polynomials of bi-degree (n,1)
Intersection distribution of degree four polynomials over finite fields
Correction to: Explicit upper bound for the average number of divisors of irreducible quadratic polynomials
Approximate degree and quantum query lower bounds via dual polynomials
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
Constructing irreducible polynomials recursively with a reverse composition method
Irreducible polynomials over finite fields for coding and cryptography
Cyclotomic numerical semigroup polynomials with at most two irreducible factors
Low-Degree Approximation of Random Polynomials
A CHARACTERIZATION OF LOW DEGREE POLYNOMIALS
On decompositions of binary recurrent polynomials
Explicit upper bound for the average number of divisors of irreducible quadratic polynomials
Factorization of quaternionic polynomials of bi-degree (n,1)
Intersection distribution of degree four polynomials over finite fields
Correction to: Explicit upper bound for the average number of divisors of irreducible quadratic polynomials
Approximate degree and quantum query lower bounds via dual polynomials
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
Constructing irreducible polynomials recursively with a reverse composition method
Irreducible polynomials over finite fields for coding and cryptography
Cyclotomic numerical semigroup polynomials with at most two irreducible factors
Low-Degree Approximation of Random Polynomials
A CHARACTERIZATION OF LOW DEGREE POLYNOMIALS
On decompositions of binary recurrent polynomials
Explicit upper bound for the average number of divisors of irreducible quadratic polynomials
Factorization of quaternionic polynomials of bi-degree (n,1)
Intersection distribution of degree four polynomials over finite fields
Correction to: Explicit upper bound for the average number of divisors of irreducible quadratic polynomials
Approximate degree and quantum query lower bounds via dual polynomials