Pages that link to "Item:Q507150"
From MaRDI portal
The following pages link to A new faster algorithm for factoring skew polynomials over finite fields (Q507150):
Displaying 14 items.
- Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
- Computing the bound of an Ore polynomial. Applications to factorization (Q1757021) (← links)
- A first step towards the skew duadic codes (Q1784999) (← links)
- Some skew constacyclic codes over \(\mathbb{F}_q+u\mathbb{F}_q\) (Q1983880) (← links)
- Counting invariant subspaces and decompositions of additive polynomials (Q1994893) (← links)
- Some new linear codes from skew cyclic codes and computer algebra challenges (Q2002144) (← links)
- The norm of a skew polynomial (Q2149532) (← links)
- A construction of self-dual skew cyclic and negacyclic codes of length \(n\) over \(\mathbb{F}_{p^n}\) (Q2232214) (← links)
- Matroidal root structure of skew polynomials over finite fields (Q5030487) (← links)
- A remark on skew factorization and new 𝔽4-linear codes (Q5101905) (← links)
- HOW A NONASSOCIATIVE ALGEBRA REFLECTS THE PROPERTIES OF A SKEW POLYNOMIAL (Q5140588) (← links)
- Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras (Q5403089) (← links)
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory (Q6123057) (← links)
- Computing a group action from the class field theory of imaginary hyperelliptic function fields (Q6543075) (← links)
