Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
From MaRDI portal
Publication:2366272
DOI10.1007/BF01386832zbMath0778.11069OpenAlexW1973696059MaRDI QIDQ2366272
Shuhong Gao, Ian F. Blake, Ronald C. Mullin
Publication date: 29 June 1993
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01386832
fast Fourier transformfinite fieldirreducible polynomialquadratic residuesquadratic nonresiduesprimitive root of unity
Related Items (27)
A New Algorithm for Decoding Reed-Solomon Codes ⋮ A note on cyclotomic polynomials and Linear Feedback Shift Registers ⋮ Enumeration formulas for self-dual cyclic codes ⋮ Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\) ⋮ Some subgroups of $mathbb{F}_q^*$ and explicit factors of $x^{2^nd}-1inmathbb{F}_q[x$] ⋮ Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x\)] ⋮ Some special cyclic codes of length 2n ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Constructive homomorphisms for classical groups. ⋮ Explicit factorization of \(X^{2^m}p^n-1\) over a finite field ⋮ On Cyclic and Negacyclic Codes of Length 8p<sup>s</sup> Over Fp<sup>m</sup> + uFp<sup>m</sup> ⋮ Unnamed Item ⋮ Explicit factorization of \(x^n-1\in \mathbb {F}_q[x\)] ⋮ Revisiting the factorization of \(x^n+1\) over finite fields with applications ⋮ Specific irreducible polynomials with linearly independent roots over finite fields ⋮ Explicit factorizations of cyclotomic polynomials over finite fields ⋮ Constacyclic codes over finite fields ⋮ On the number of k-normal elements over finite fields ⋮ Existence conditions for self-orthogonal negacyclic codes over finite fields ⋮ On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials ⋮ On self-dual negacirculant codes of index two and four ⋮ Further factorization of \(x^n - 1\) over a finite field ⋮ Structure of repeated-root constacyclic codes of length 8ℓmpn ⋮ Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\) ⋮ Factorization of Dickson polynomials over finite fields ⋮ On monogenity of certain number fields defined by trinomials ⋮ Further factorization of xn − 1 over a finite field (II)
Cites Work
This page was built for publication: Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
