We mainly investigate the structures of skew cyclic and skew quasicyclic codes of arbitrary length over Galois rings. Similar to [5], our results show that the skew cyclic codes are equivalent to either cyclic and quasi-cyclic codes over Galois rings. Moreover, we give a necessary and sufficient condition for skew cyclic codes over Galois rings to be free. A sufficient condition for 1-generator...

In this article, we study skew cyclic codes over ring R = Fq + vFq + v 2 Fq, where q = p, p is an odd prime and v3 = v. We describe generator polynomials of skew cyclic codes over this ring and investigate the structural properties of skew cyclic codes over R by a decomposition theorem. We also describe the generator polynomials of the duals of skew cyclic codes. Moreover, the idempotent genera...

Linear codes may be endowed with cyclic structures by means of skew polynomial rings. This is the case of Piret cyclic convolutional codes [26] and the subsequent generalizations and alternatives (see [27], [14], [11], [25], [16], [20]). Non commutative cyclic structures of this kind have been also considered for block linear codes ([7], [5], [4], [12], [1]), and for linear codes over commutati...

In this paper, we give the enumeration formulas for Euclidean selfdual skew-cyclic codes over finite fields when (n, |θ|) = 1 and for some cases when (n, |θ|) > 1, where n is the length of the code and |θ| is the order of automorphism θ.

In this paper, we study skew cyclic codes over the ring R = Fq + uFq + vFq + uvFq, where u 2 = u, v2 = v, uv = vu, q = p and p is an odd prime. We investigate the structural properties of skew cyclic codes over R through a decomposition theorem. Furthermore, we give a formula for the number of skew cyclic codes of length n over R.

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming distance is gained, and it is possible to design efficient decoding algorithms. In this paper, we give a version of the Hartmann-Tzeng bound that works for a wide ...

The construction of cyclic codes can be generalized to so-called ”module θ-codes” using noncommutative polynomials. The product of the generator polynomial g of a self-dual ”module θ-code” and its ”skew reciprocal polynomial” is known to be a noncommutative polynomial of the form X − a, reducing the problem of the computation of all such codes to the resolution of a polynomial system where the ...

In this paper we generalize coding theory of cyclic codes over finite fields to skew polynomial rings over finite rings. Codes that are principal ideals in quotient rings of skew polynomial rings by two sided ideals are studied. Next we consider skew codes of endomorphism type and derivation type. And we give some examples. Mathematics Subject Classification: Primary 94B60; Secondary 94B15, 16D25