Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\)
From MaRDI portal
Publication:499673
DOI10.1007/s10623-014-0005-yzbMath1329.11128arXiv1404.6281OpenAlexW2963636848MaRDI QIDQ499673
Lilian Batista de Oliveira, Carmen Rosa Giraldo Vergara, Fabio Enrique Brochero Martínez
Publication date: 30 September 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6281
Related Items
Counting irreducible binomials over finite fields, 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\)], The estimated number of irreducible binomials, Weight enumerators of reducible cyclic codes and their dual codes, A class of minimal cyclic codes over finite fields, Primitive idempotents of irreducible cyclic codes of length \(n\), Structure of finite dihedral group algebra., Explicit factorizations of cyclotomic polynomials over finite fields, On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials, Further factorization of \(x^n - 1\) over a finite field, 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\), Factorization of Dickson polynomials over finite fields, Further factorization of xn − 1 over a finite field (II), Weight enumerator of some irreducible cyclic codes
Cites Work
- On explicit factors of cyclotomic polynomials over finite fields
- Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields
- 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
- Bit-serial Reed - Solomon encoders
- Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
