A new faster algorithm for factoring skew polynomials over finite fields

DOI10.1016/J.JSC.2016.02.016MaRDI QIDQ507150zbMATH OpenOpenAlexFDO

Authors 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

factorizationskew polynomialAzumaya algebra

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)

Recommendations

• Factoring in skew-polynomial rings over finite fields
• scientific article; zbMATH DE number 1263216
• scientific article; zbMATH DE number 1273636
• Fast Multiplication for Skew Polynomials
• Factoring polynomials over finite fields

Cites work

• scientific article; zbMATH DE number 3425708 (Why is no real title available?)
• scientific article; zbMATH DE number 3900960 (Why is no real title available?)
• scientific article; zbMATH DE number 3745409 (Why is no real title available?)
• scientific article; zbMATH DE number 107550 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 3297825 (Why is no real title available?)
• scientific article; zbMATH DE number 3417620 (Why is no real title available?)
• A fast algorithm for computing the characteristic polynomial of the \(p\)-curvature
• Composition collisions and projective polynomials: statement of results
• Derangements and Eigenvalue-Free Elements in Finite Classical Groups
• Factoring in skew-polynomial rings over finite fields
• Finite-Dimensional Division Algebras over Fields
• On Maximally Central Algebras
• Powers of tensors and fast matrix multiplication
• Subquadratic-time factoring of polynomials over finite fields
• Theory of codes with maximum rank distance
• Theory of non-commutative polynomials

Cited in

(17)

• A construction of self-dual skew cyclic and negacyclic codes of length \(n\) over \(\mathbb{F}_{p^n}\)
• Counting invariant subspaces and decompositions of additive polynomials
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Basic module theory over non-commutative rings with computational aspects of operator algebras
• A first step towards the skew duadic codes
• Computing a group action from the class field theory of imaginary hyperelliptic function fields
• Computing the bound of an Ore polynomial. Applications to factorization
• A remark on skew factorization and new 𝔽4-linear codes
• Some new linear codes from skew cyclic codes and computer algebra challenges
• How a nonassociative algebra reflects the properties of a skew polynomial
• Matroidal root structure of skew polynomials over finite fields
• The norm of a skew polynomial
• A new efficient factorization algorithm for polynomials over small finite fields
• Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
• Some skew constacyclic codes over \(\mathbb{F}_q+u\mathbb{F}_q\)
• Fast operations on linearized polynomials and their applications in coding theory
• On a New Factorization Algorithm for Polynomials Over Finite Fields

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

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