Further factorization of xn − 1 over a finite field (II)
From MaRDI portal
Publication:5025145
DOI10.1142/S1793830921500701zbMath1483.11259arXiv2012.08161OpenAlexW3110704910MaRDI QIDQ5025145
Publication date: 1 February 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.08161
Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06) Cyclic codes (94B15)
Cites Work
- Unnamed Item
- Unnamed Item
- Dickson polynomials over finite fields
- Explicit factorization of \(x^n-1\in \mathbb {F}_q[x\)]
- Explicit factorizations of cyclotomic polynomials over finite fields
- On explicit factors of cyclotomic polynomials over finite fields
- The weight distributions of two classes of \(p\)-ary cyclic codes with few weights
- The primitive idempotents and weight distributions of irreducible constacyclic codes
- Further factorization of \(x^n - 1\) over a finite field
- Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
- Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields
- Composed products and factors of cyclotomic polynomials over finite fields
- A construction of linear codes and their complete weight enumerators
- Cyclotomy and permutation polynomials of large indices
- Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
- Complete weight enumerators of a class of linear codes
- A class of minimal cyclic codes over finite fields
This page was built for publication: Further factorization of xn − 1 over a finite field (II)