In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise description of quotients of skew polynomial rings by a left principal ideal, using results relating skew polynomial rings to Azumaya algebras. We use this des...

A ring $R$ is called a left Ikeda-Nakayama (left IN-ring) if the right annihilator of intersection any two ideals sum annihilators. As generalization IN-rings, SA-ring annihilators an ideal $R$. It natural to ask IN and SA property can be extended from $R[x; \alpha, \delta]$. In this note, results concerning conditions will allow these properties transfer skew polynomials $R[x;\alpha,\delta]$ a...

We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...