Pages that link to "Item:Q499673"
From MaRDI portal
The following pages link to Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\) (Q499673):
Displaying 27 items.
- Weight enumerator of some irreducible cyclic codes (Q256579) (← links)
- Structure of finite dihedral group algebra. (Q492009) (← links)
- Explicit factorizations of cyclotomic polynomials over finite fields (Q517278) (← links)
- Factorization of a class of polynomials over finite fields (Q661980) (← links)
- Ireducible quadratic factors of \(x^{(q^n+1)/2}+ax+b\) over \(\mathbb{F}_q\) (Q1383498) (← links)
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708) (← links)
- Weight enumerators of reducible cyclic codes and their dual codes (Q1712510) (← links)
- Primitive idempotents of irreducible cyclic codes of length \(n\) (Q1721319) (← links)
- Further factorization of \(x^n - 1\) over a finite field (Q1800700) (← links)
- On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials (Q2031633) (← links)
- Factorization of Dickson polynomials over finite fields (Q2107676) (← links)
- The estimated number of irreducible binomials (Q2197989) (← links)
- Existence results on \(k\)-normal elements over finite fields (Q2313563) (← links)
- Factorization of composed polynomials and applications (Q2329189) (← links)
- Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\) (Q2329194) (← links)
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) (Q2366272) (← links)
- Explicit factorization of \(X^{2^m}p^n-1\) over a finite field (Q2447801) (← links)
- Counting irreducible binomials over finite fields (Q2634386) (← links)
- On the factorization of \(f(n)\) for \(f(x)\) in \(\mathbb Z[x]\) (Q2840301) (← links)
- Factorisation of $x^N - q$ over Q (Q3731713) (← links)
- (Q4367474) (← links)
- Some subgroups of $mathbb{F}_q^*$ and explicit factors of $x^{2^nd}-1inmathbb{F}_q[x]$ (Q4997209) (← links)
- Further factorization of xn − 1 over a finite field (II) (Q5025145) (← links)
- (Q5475911) (← links)
- A class of minimal cyclic codes over finite fields (Q5890958) (← links)
- Equal-degree factorization of binomials and trinomials over finite fields (Q6584731) (← links)
- Repeated-root constacyclic codes of length \(k^s l^m p^n\) over finite fields (Q6655761) (← links)
