Cyclic codes over finite rings

It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial xn − 1 in F[x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite rings and proves the above characterization to be true for a large class of such codes over these rings.