Computing the bound of an Ore polynomial. Applications to factorization
From MaRDI portal
Abstract: We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization algorithm. The asymptotic time complexity in the degree of the given Ore polynomial is studied. In the class of Ore polynomials over a finite field, our algorithm is an alternative to Giesbretch's one that reduces the complexity in the degree of the polynomial.
Recommendations
Cites work
- scientific article; zbMATH DE number 2123131 (Why is no real title available?)
- scientific article; zbMATH DE number 4136133 (Why is no real title available?)
- scientific article; zbMATH DE number 4049807 (Why is no real title available?)
- scientific article; zbMATH DE number 3783206 (Why is no real title available?)
- scientific article; zbMATH DE number 1273634 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 1988897 (Why is no real title available?)
- scientific article; zbMATH DE number 2151191 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- scientific article; zbMATH DE number 3367062 (Why is no real title available?)
- scientific article; zbMATH DE number 3058859 (Why is no real title available?)
- scientific article; zbMATH DE number 3095858 (Why is no real title available?)
- A New Perspective of Cyclicity in Convolutional Codes
- A new faster algorithm for factoring skew polynomials over finite fields
- A rational function decomposition algorithm by near-separated polynomials
- Algebraic andF-Independent Sets in 2-Firs
- Basic module theory over non-commutative rings with computational aspects of operator algebras
- Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem
- Coding with skew polynomial rings
- Computing Frobenius maps and factoring polynomials
- Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\)
- FFT-like multiplication of linear differential operators
- Factoring in skew-polynomial rings over finite fields
- Factoring polynomials over finite fields: A survey
- Fast multiplication of large numbers
- Fast multiplication of polynomials over fields of characteristic 2
- Finite-Dimensional Division Algebras over Fields
- Introduction to quadratic forms
- Linear codes using skew polynomials with automorphisms and derivations
- On fast multiplication of polynomials over arbitrary algebras
- Powers of tensors and fast matrix multiplication
- Theory of non-commutative polynomials
- Zero divisors in quaternion algebras
- (, )-codes
Cited in
(9)- scientific article; zbMATH DE number 2151191 (Why is no real title available?)
- Division algebras and MRD codes from skew polynomials
- How a nonassociative algebra reflects the properties of a skew polynomial
- A generalisation of Amitsur's A-polynomials
- The norm of a skew polynomial
- Skew differential Goppa codes and their application to McEliece cryptosystem
- Basic module theory over non-commutative rings with computational aspects of operator algebras
- An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials.
- Primitive idempotents in central simple algebras over \(\mathbb{F}_q(t)\) with an application to coding theory
This page was built for publication: Computing the bound of an Ore polynomial. Applications to factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1757021)
