Irreducibles and the composed product for polynomials over a finite field
Discrete Mathematics
Finite fields
Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
Mathematics of Computation
Factorizations of root-based polynomial compositions
Discrete Mathematics
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Irreducible compositions of polynomials over finite fields
Designs, Codes and Cryptography
On explicit factors of cyclotomic polynomials over finite fields
Designs, Codes and Cryptography
Bit-serial Reed - Solomon encoders
IEEE Transactions on Information Theory
The minimal polynomial over Fq of linear recurring sequence over Fqm
Finite Fields and Their Applications
Note: Factorization of the Cyclotomic Polynomial x2n+ 1 over Finite Fields
Finite Fields and Their Applications
Factors of Dickson polynomials over finite fields
Finite Fields and Their Applications
Explicit theorems on generator polynomials
Finite Fields and Their Applications
Hi-index | 0.00 |
Let q = p s be a power of a prime number p and let $${\mathbb {F}_{\rm q}}$$ be a finite field with q elements. This paper aims to demonstrate the utility and relation of composed products to other areas such as the factorization of cyclotomic polynomials, construction of irreducible polynomials, and linear recurrence sequences over $${\mathbb {F}_{\rm q}}$$ . In particular we obtain the explicit factorization of the cyclotomic polynomial $${\Phi_{2^nr}}$$ over $${\mathbb {F}_{\rm q}}$$ where both r 驴 3 and q are odd, gcd(q, r) = 1, and $${n\in \mathbb{N}}$$ . Previously, only the special cases when r = 1, 3, 5, had been achieved. For this we make the assumption that the explicit factorization of $${\Phi_r}$$ over $${\mathbb {F}_{\rm q}}$$ is given to us as a known. Let $${n = p_1^{e_1}p_2^{e_2}\cdots p_s^{e_s}}$$ be the factorization of $${n \in \mathbb{N}}$$ into powers of distinct primes p i , 1 驴 i 驴 s. In the case that the multiplicative orders of q modulo all these prime powers $${p_i^{e_i}}$$ are pairwise coprime, we show how to obtain the explicit factors of $${\Phi_{n}}$$ from the factors of each $${\Phi_{p_i^{e_i}}}$$ . We also demonstrate how to obtain the factorization of $${\Phi_{mn}}$$ from the factorization of $${\Phi_n}$$ when q is a primitive root modulo m and $${{\rm gcd}(m, n) = {\rm gcd}(\phi(m),{\rm ord}_n(q)) = 1.}$$ Here $${\phi}$$ is the Euler's totient function, and ord n (q) denotes the multiplicative order of q modulo n. Moreover, we present the construction of a new class of irreducible polynomials over $${\mathbb {F}_{\rm q}}$$ and generalize a result due to Varshamov (Soviet Math Dokl 29:334---336, 1984).