A new faster algorithm for factoring skew polynomials over finite fields

DOI10.1016/j.jsc.2016.02.016zbMath1373.16046OpenAlexW2306849934MaRDI QIDQ507150

Xavier Caruso, Jérémy Le Borgne

Publication date: 3 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2016.02.016

zbMATH Keywords

Azumaya algebrafactorizationskew polynomial

Mathematics Subject Classification ID

Ordinary and skew polynomial rings and semigroup rings (16S36) Computational aspects of associative rings (general theory) (16Z05) Separable algebras (e.g., quaternion algebras, Azumaya algebras, etc.) (16H05)

Related Items (13)

Fast operations on linearized polynomials and their applications in coding theory ⋮ The norm of a skew polynomial ⋮ A remark on skew factorization and new 𝔽4-linear codes ⋮ Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ HOW A NONASSOCIATIVE ALGEBRA REFLECTS THE PROPERTIES OF A SKEW POLYNOMIAL ⋮ A construction of self-dual skew cyclic and negacyclic codes of length \(n\) over \(\mathbb{F}_{p^n}\) ⋮ Some skew constacyclic codes over \(\mathbb{F}_q+u\mathbb{F}_q\) ⋮ Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ Computing the bound of an Ore polynomial. Applications to factorization ⋮ Some new linear codes from skew cyclic codes and computer algebra challenges ⋮ A first step towards the skew duadic codes ⋮ Matroidal root structure of skew polynomials over finite fields

Cites Work

• Theory of codes with maximum rank distance
• Factoring in skew-polynomial rings over finite fields
• Theory of non-commutative polynomials
• Composition collisions and projective polynomials
• A fast algorithm for computing the characteristic polynomial of the p-curvature
• Powers of tensors and fast matrix multiplication
• Derangements and Eigenvalue-Free Elements in Finite Classical Groups
• Subquadratic-time factoring of polynomials over finite fields
• Finite-Dimensional Division Algebras over Fields
• On Maximally Central Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new faster algorithm for factoring skew polynomials over finite fields