Further factorization of $x^n-1$ over a finite field
Yansheng Wu, Qin Yue, and Shuqin Fan

TL;DR
This paper extends the explicit factorization of $x^n - 1$ over finite fields to cases where the radical of $n$ divides $q^w - 1$ but not $q - 1$, providing new factorization formulas and counts.
Contribution
It generalizes previous factorization results to new conditions involving prime powers, offering explicit formulas and counts for irreducible factors.
Findings
Explicit factorization of $x^n - 1$ over $F_q$ under new divisibility conditions
Derived formulas for counting irreducible factors
Extended understanding of polynomial factorization over finite fields
Abstract
Let be a finite field with elements and a positive integer. Mart\'inez, Vergara and Oliveira \cite{MVO} explicitly factorized over under the condition of . In this paper, suppose that and , where is a prime, we explicitly factorize into irreducible factors in and count the number of its irreducible factors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Islamic Finance and Communication · Cooperative Communication and Network Coding
