Factoring in skew-polynomial rings over finite fields
DOI10.1006/JSCO.1998.0224zbMATH Open0941.68160OpenAlexW1990226699MaRDI QIDQ1269751FDOQ1269751
Authors: Mark Giesbrecht 
Publication date: 27 June 2000
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5d39756e4db4bf5a95664c37c8bc9144575d065a
Recommendations
Symbolic computation and algebraic computation (68W30) Ordinary and skew polynomial rings and semigroup rings (16S36) Computational aspects of associative rings (general theory) (16Z05)
Cited In (34)
- An overview on skew constacyclic codes and their subclass of LCD codes
- Intersecting two classical groups.
- A modular algorithm for computing the exponential solutions of a linear differential operator
- Testing reducibility of linear differential operators: A group theoretic perspective
- On decomposition of sub-linearised-polynomials
- On the complexity of skew arithmetic
- Counting invariant subspaces and decompositions of additive polynomials
- A remark on skew factorization and new 𝔽4-linear codes
- Self-dual skew codes and factorization of skew polynomials
- Constructing Generalized Bent Functions from Trace Forms of Galois Rings
- Factorization of ℤ$$ \mathbb {Z}$$-Homogeneous Polynomials in the First q-Weyl Algebra
- A first step towards the skew duadic codes
- Title not available (Why is that?)
- A Note on the Existence of Self-Dual Skew Codes over Finite Fields
- 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 characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- Computing the bound of an Ore polynomial. Applications to factorization
- Efficient decomposition of associative algebras over finite fields
- Rank-Metric Codes and Their Applications
- Factoring octonion polynomials
- New semifields and new MRD codes from skew polynomial rings
- From \(r\)-linearized polynomial equations to \(r^m\)-linearized polynomial equations
- Construction and number of self-dual skew codes over \(\mathbb{F}_{p^2}\)
- The automorphisms of Petit’s algebras
- Linearized polynomials over finite fields revisited
- Finite nonassociative algebras obtained from skew polynomials and possible applications to \((f,\sigma,\delta)\)-codes
- A circulant approach to skew-constacyclic codes
- An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials.
- A new faster algorithm for factoring skew polynomials over finite fields
- HOW A NONASSOCIATIVE ALGEBRA REFLECTS THE PROPERTIES OF A SKEW POLYNOMIAL
- On some skew codes over \(\mathbb{Z}_q+u \mathbb{Z}_q\)
- Matroidal root structure of skew polynomials over finite fields
- Some new linear codes from skew cyclic codes and computer algebra challenges
This page was built for publication: Factoring in skew-polynomial rings over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269751)
