Factoring in skew-polynomial rings over finite fields

From MaRDI portal
Publication:1269751

DOI10.1006/jsco.1998.0224zbMath0941.68160OpenAlexW1990226699MaRDI QIDQ1269751

Mark W. 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



Related Items

An overview on skew constacyclic codes and their subclass of LCD codes, An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials., A modular algorithm for computing the exponential solutions of a linear differential operator, Factorization of ℤ$$ \mathbb {Z}$$-Homogeneous Polynomials in the First q-Weyl Algebra, On decomposition of sub-linearised-polynomials, Construction and number of self-dual skew codes over \(\mathbb{F}_{p^2}\), Testing reducibility of linear differential operators: A group theoretic perspective, Finite nonassociative algebras obtained from skew polynomials and possible applications to \((f,\sigma,\delta)\)-codes, A Note on the Existence of Self-Dual Skew Codes over Finite Fields, A remark on skew factorization and new 𝔽4-linear codes, A characterization of the number of roots of linearized and projective polynomials in the field of coefficients, New semifields and new MRD codes from skew polynomial rings, From \(r\)-linearized polynomial equations to \(r^m\)-linearized polynomial equations, Self-dual skew codes and factorization of skew polynomials, Intersecting two classical groups., Linearized polynomials over finite fields revisited, HOW A NONASSOCIATIVE ALGEBRA REFLECTS THE PROPERTIES OF A SKEW POLYNOMIAL, Efficient decomposition of associative algebras over finite fields, A circulant approach to skew-constacyclic codes, 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, The automorphisms of Petit’s algebras, A new faster algorithm for factoring skew polynomials over finite fields, Counting invariant subspaces and decompositions of additive polynomials, Computing the bound of an Ore polynomial. Applications to factorization, Some new linear codes from skew cyclic codes and computer algebra challenges, A first step towards the skew duadic codes, Constructing Generalized Bent Functions from Trace Forms of Galois Rings, Rank-Metric Codes and Their Applications, On the complexity of skew arithmetic, Matroidal root structure of skew polynomials over finite fields