A new faster algorithm for factoring skew polynomials over finite fields
DOI10.1016/J.JSC.2016.02.016zbMATH Open1373.16046OpenAlexW2306849934MaRDI QIDQ507150FDOQ507150
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
Recommendations
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)
Cites Work
- Powers of tensors and fast matrix multiplication
- Factoring in skew-polynomial rings over finite fields
- Theory of non-commutative polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-Dimensional Division Algebras over Fields
- Theory of codes with maximum rank distance
- Subquadratic-time factoring of polynomials over finite fields
- On Maximally Central Algebras
- Composition collisions and projective polynomials
- A fast algorithm for computing the characteristic polynomial of the p-curvature
- Title not available (Why is that?)
- Title not available (Why is that?)
- Derangements and Eigenvalue-Free Elements in Finite Classical Groups
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (17)
- Counting invariant subspaces and decompositions of additive polynomials
- Fast operations on linearized polynomials and their applications in coding theory
- A remark on skew factorization and new 𝔽4-linear codes
- A New Algorithm for Factoring Polynomials Over Finite Fields
- A first step towards the skew duadic codes
- 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
- A new efficient factorization algorithm for polynomials over small finite fields
- Computing the bound of an Ore polynomial. Applications to factorization
- The norm of a skew polynomial
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- HOW A NONASSOCIATIVE ALGEBRA REFLECTS THE PROPERTIES OF A SKEW POLYNOMIAL
- Computing a group action from the class field theory of imaginary hyperelliptic function fields
- Matroidal root structure of skew polynomials over finite fields
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
- Some new linear codes from skew cyclic codes and computer algebra challenges
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)
