Further factorization of $x^n-1$ over finite fields (II)
Information Theory
2020-12-16 v1 math.IT
Abstract
Let be a finite field with elements. Let be a positive integer with radical , namely, the product of distinct prime divisors of . If the order of modulo is either 1 or a prime, then the irreducible factorization and a counting formula of irreducible factors of over were obtained by Mart\'{\i}nez, Vergara, and Oliveira (Des Codes Cryptogr 77 (1) : 277-286, 2015) and Wu, Yue, and Fan (Finite Fields Appl 54: 197-215, 2018). In this paper, we explicitly factorize into irreducible factors in and calculate the number of the irreducible factors when the order of modulo is a product of two primes.
Cite
@article{arxiv.2012.08161,
title = {Further factorization of $x^n-1$ over finite fields (II)},
author = {Yansheng Wu and Qin Yue},
journal= {arXiv preprint arXiv:2012.08161},
year = {2020}
}
Comments
23 pages. Accepted by Discrete Mathematics, Algorithms and Applications