Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of x − λ, where λ is a unit element, are exhibited. When λ = 1, the generators of Euclidean and Hermitian dual codes of such codes are determined tog...

We introduce the notion ofstrongly $alpha$-reversible rings which is a strong version of$alpha$-reversible rings, and investigate its properties. We firstgive an example to show that strongly reversible rings need not bestrongly $alpha$-reversible. We next argue about the strong$alpha$-reversibility of some kinds of extensions. A number ofproperties of this version are established. It is shown ...

In this work the definition of codes as modules over skew polynomial rings of automorphism type is generalized to skew polynomial rings, whose multiplication is defined using an automorphism and a derivation. This produces a more general class of codes which, in some cases, produce better distance bounds than module skew codes constructed only with an automorphism. Extending the approach of Gab...