Explicit factorization of x^n-1 F_q[x]

DOI10.1007/S10623-014-0005-YzbMATH Open1329.11128arXiv1404.6281OpenAlexW2963636848MaRDI QIDQ499673FDOQ499673

F. E. Brochero Martínez, Lilian Batista de Oliveira, C. R. Giraldo Vergara

Publication date: 30 September 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Let $mathbb{F}_q$ be a finite field and $n$ a positive integer. In this article, we prove that, under some conditions on $q$ and $n$, the polynomial $x^n-1$ can be split into irreducible binomials $x^t-a$ and an explicit factorization into irreducible factors is given. Finally, weakening one of our hypothesis, we also obtain factors of the form $x^{2t}-a{x}^t+b$ and explicit splitting of $x^n-1$ into irreducible factors is given.

Full work available at URL: https://arxiv.org/abs/1404.6281

Recommendations

• Factorisation of $x^N - q$ over Q
• scientific article
• Explicit factorization of \({x^N} \pm a\) over a finite field
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
• Factorization at fixed \(Q^{2}(1 - x)\)
• Factorization of \(x^n - 1\) over the finite field \(\mathbb F_p\)
• Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\)
• The explicit factorization of \(x^{2^n}-\mu\) over finite fields
• scientific article
• Factorization in K[Xⁿ, Xⁿ⁺¹,…,X²ⁿ⁻¹]

zbMATH Keywords

cyclic codescyclotomic polynomialirreducible factor

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites Work

• Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
• Title not available (Why is that?)
• Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
• On explicit factors of cyclotomic polynomials over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
• Bit-serial Reed - Solomon encoders

Cited In (26)

• Ireducible quadratic factors of \(x^{(q^n+1)/2}+ax+b\) over \(\mathbb{F}_q\)
• Weight enumerator of some irreducible cyclic codes
• Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\)
• Title not available (Why is that?)
• Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
• Factorization of composed polynomials and applications
• A class of minimal cyclic codes over finite fields
• On the factorization of \(f(n)\) for \(f(x)\) in \(\mathbb Z[x]\)
• Further factorization of \(x^n - 1\) over a finite field
• Counting irreducible binomials over finite fields
• Equal-degree factorization of binomials and trinomials over finite fields
• Factorization of Dickson polynomials over finite fields
• On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials
• Further factorization of xn − 1 over a finite field (II)
• Title not available (Why is that?)
• Factorisation of $x^N - q$ over Q
• Primitive idempotents of irreducible cyclic codes of length \(n\)
• Weight enumerators of reducible cyclic codes and their dual codes
• The estimated number of irreducible binomials
• Existence results on \(k\)-normal elements over finite fields
• Structure of finite dihedral group algebra.
• Repeated-root constacyclic codes of length \(k^s l^m p^n\) over finite fields
• Some subgroups of $mathbb{F}_q^*$ and explicit factors of $x^{2^nd}-1inmathbb{F}_q[x]$
• Explicit factorizations of cyclotomic polynomials over finite fields
• Factorization of a class of polynomials over finite fields
• Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)

This page was built for publication: Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499673)