We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes the rank metric, lifted subspace and linearized Reed-Solomon sum-rank metric. The speed-ups are achieved by new that reduce cores of underlying computational problems decoders to one common tool: computing left right approximant bases matrices over skew polynomial rings. To accompli...

Abstract. Quantum symmetric algebras (or noncommutative polynomial rings) arise in many places in mathematics. In this article we find the multiplicative structure of their Hochschild cohomology when the coefficients are in an arbitrary bimodule algebra. When this bimodule algebra is a finite group extension (under a diagonal action) of a quantum symmetric algebra, we give explicitly the graded...

For many algebraic codes the main part of decoding can be reduced to a shift register synthesis problem. In this paper we present an approach for solving generalised shift register problems over skew polynomial rings which occur in error and erasure decoding of `-Interleaved Gabidulin codes. The algorithm is based on module minimisation and has time complexity O(`μ) where μ measures the size of...

let $r$ be an infinite ring. here we prove that if $0_r$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin x}$ for every infinite subset $x$ of $r$, then $r$ satisfies the polynomial identity $x^n=0$. also we prove that if $0_r$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in x}$ for every infinite subset $x$ of $r$, then $x^n=x$ for all $xin r$.

We consider finite groups acting on quantum (or skew) polynomial rings. Deformations of the semidirect product of the quantum polynomial ring with the acting group extend symplectic reflection algebras and graded Hecke algebras to the quantum setting over a field of arbitrary characteristic. We give necessary and sufficient conditions for such algebras to satisfy a Poincaré-Birkhoff-Witt proper...