Coding with skew polynomial rings (Q733504): Difference between revisions

The authors generalize the \(\theta\)-cyclic code defined by \textit{D. Boucher, W. Geiselmann} and \textit{F. Ulmer} [Appl. Algebra Eng. Commun. Comput. 18, No. 4, 379--389 (2007; Zbl 1159.94390)] and study their properties. These are closely related to properties of the ring \(\mathbb{F}_q[X, \theta]\) of skew polynomials [see \textit{B. R. McDonald}, Finite rings with identity. New York: Marcel Dekker (1974; Zbl 0294.16012)]. It is shown that any skew polynomial \(g\) is a generating polynomial of a suitable \(\theta\)-code. The minimal length for a \(g\) is determined by the degree of the generator of the maximal two sided ideal contained in the left ideal \((g) \subset \mathbb{F}_q[X, \theta ]\). The Euclidean ring structure of \(\mathbb{F}_q[X, \theta ]\) determines the properties of such a code. It is also proved that dual of a \(\theta \)-cyclic code is also a \(\theta \)-cyclic code. The lists of Euclidean and Hermitian self-dual \(\theta \)-cyclic codes over \(\mathbb{F}_4\) of length \(n\leq 40\) are given. There are 3 equivalent \([36,18,11]\) Euclidean self-dual \(\theta\)-cyclic codes, which are better than the known self-dual codes over \(\mathbb{F}_4.\)