Explicit factorization of x^n-1 F_q[x]
From MaRDI portal
Publication:499673
Abstract: Let be a finite field and a positive integer. In this article, we prove that, under some conditions on and , the polynomial can be split into irreducible binomials and an explicit factorization into irreducible factors is given. Finally, weakening one of our hypothesis, we also obtain factors of the form and explicit splitting of into irreducible factors is given.
Recommendations
- Factorisation of x^N - q over Q
- scientific article; zbMATH DE number 3773731
- Explicit factorization of \({x^N} \pm a\) over a finite field
- Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
- Factorization at fixed \(Q^{2}(1 - x)\)
- Factorization of x^n - 1 over the finite field F_p
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\)
- The explicit factorization of \(x^{2^n}-\mu\) over finite fields
- scientific article; zbMATH DE number 3861283
- Factorization in K[Xn, Xn+1,…,X2n−1]
Cites work
- Bit-serial Reed - Solomon encoders
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
- Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
- Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
- Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- On explicit factors of cyclotomic polynomials over finite fields
Cited in
(38)- Ireducible quadratic factors of \(x^{(q^n+1)/2}+ax+b\) over \(\mathbb{F}_q\)
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\)
- Weight enumerators of reducible cyclic codes and their dual codes
- Primitive idempotents of irreducible cyclic codes of length \(n\)
- Further factorization of \(x^n - 1\) over a finite field
- On polynomials x^n-1 over binary fields whose irreducible factors are binomials and trinomials
- Factorization of Dickson polynomials over finite fields
- The estimated number of irreducible binomials
- Existence results on \(k\)-normal elements over finite fields
- Factorization of composed polynomials and applications
- Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
- Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
- Weight enumerator of some irreducible cyclic codes
- Counting irreducible binomials over finite fields
- On the factorization of \(f(n)\) for \(f(x)\) in \(\mathbb Z[x]\)
- Explicit factorization of \(x^{2^ap^br^c}-1\) over a finite field
- Factorisation of x^N - q over Q
- scientific article; zbMATH DE number 1092188 (Why is no real title available?)
- The explicit factorization of \(x^{2^n}-\mu\) over finite fields
- Explicit factorization of \({x^N} \pm a\) over a finite field
- Structure of finite dihedral group algebra.
- Some subgroups of \(\mathbb{F}_q^*\) and explicit factors of \(x^{2^nd}-1\in \mathbb{F}_q[x]\)
- Further factorization of x^n-1 over a finite field. II
- Explicit factorizations of cyclotomic polynomials over finite fields
- Factorization of polynomial x^n - 1 over finite fields
- scientific article; zbMATH DE number 5036652 (Why is no real title available?)
- A class of minimal cyclic codes over finite fields
- Equal-degree factorization of binomials and trinomials over finite fields
- Factorization of a class of polynomials over finite fields
- Repeated-root constacyclic codes of length k^s l^m p^n over finite fields
- More on the sum-freedom of the multiplicative inverse function
- Closed formulas for the generators of all constacyclic codes and for the factorization of \(X^{n} - 1\), the \(n\)-th cyclotomic polynomial and every composition of the form \(f(X^n)\) over a finite field for arbitrary positive integers \(n\)
- Computing factors of cyclotomic polynomials over finite fields
- The set of representatives and explicit factorization of x^n-1 over finite fields
- The 3-sparsity of X^n-1 over finite fields of characteristic 2
- Factorization of cyclotomic polynomial values at Mersenne prime polynomials
- A survey of polynomial multiplications for lattice-based cryptosystems
This page was built for publication: Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499673)
