Pages that link to "Item:Q2366272"
From MaRDI portal
The following pages link to Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) (Q2366272):
Displayed 27 items.
- Enumeration formulas for self-dual cyclic codes (Q324259) (← links)
- Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\) (Q499673) (← links)
- Explicit factorizations of cyclotomic polynomials over finite fields (Q517278) (← links)
- Constructive homomorphisms for classical groups. (Q629346) (← links)
- Specific irreducible polynomials with linearly independent roots over finite fields (Q677139) (← links)
- Constacyclic codes over finite fields (Q690432) (← links)
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708) (← links)
- On self-dual negacirculant codes of index two and four (Q1791665) (← links)
- Further factorization of \(x^n - 1\) over a finite field (Q1800700) (← links)
- Revisiting the factorization of \(x^n+1\) over finite fields with applications (Q1983385) (← links)
- Existence conditions for self-orthogonal negacyclic codes over finite fields (Q2018424) (← 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)
- On monogenity of certain number fields defined by trinomials (Q2108517) (← links)
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\) (Q2158236) (← 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^m}p^n-1\) over a finite field (Q2447801) (← links)
- Some special cyclic codes of length 2n (Q2958466) (← links)
- A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← 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)
- (Q5038389) (← links)
- A note on cyclotomic polynomials and Linear Feedback Shift Registers (Q5056514) (← links)
- On Cyclic and Negacyclic Codes of Length 8p<sup>s</sup> Over Fp<sup>m</sup> + uFp<sup>m</sup> (Q5140057) (← links)
- Structure of repeated-root constacyclic codes of length 8ℓmpn (Q5223079) (← links)
- On the number of k-normal elements over finite fields (Q5743018) (← links)
- MyOPE: malicious security for oblivious polynomial evaluation (Q6134853) (← links)
