Skew Cyclic and Skew Constacyclic Codes over a Mixed Alphabet

Abstract

In this note, we study skew cyclic and skew constacyclic codes over the mixed alphabet $\mathcal{R}={\mathbb{F}}_q{\mathcal{R}}_1{\mathcal{R}}_2$, where $q=p^m,$ p is an odd prime with m odd and ${\mathcal{R}}_1={\mathbb{F}}_q+u{\mathbb{F}}_q$ with $u^2=u$, and ${\mathcal{R}}_2={\mathbb{F}}_q+u{\mathbb{F}}_q+v{\mathbb{F}}_q$ with $u^2=u,v^2=v,uv=vu=0.$ Such codes consist of the juxtaposition of three codes of the same size over ${\mathbb{F}}_q,$ ${\mathcal{R}}_1,$ and ${\mathcal{R}}_2$, respectively. We investigate the generator polynomial for skew cyclic codes over $\mathcal{R}$. Furthermore, we discuss the structural properties of the skew cyclic and skew constacyclic codes over $\mathcal{R}.$ We also study their q-ary images under suitable Gray maps.

1. Introduction

The most widely used family of linear codes consists of cyclic codes. Inspired by codes for the Lee metric [1], Berlekamp adapted them to constacyclic codes. Since then, as the following paragraphs demonstrate, they have happened in a number of circumstances.

Skew cyclic codes were first introduced as ideals in the skew polynomial ring $\mathbb{F}[x;\theta ]$ in 2007 by Boucher et al. [2], where $\theta$ represents an automorphism of the finite field $\mathbb{F}.$ The tables of the most well-known codes were enhanced by the numerous numerical samples that this technique created. The fact that the factorization of the polynomial $x^n-1$ is not unique gives skew polynomial rings an advantage over commutative polynomial rings. For a given length, these numerous factorizations produce a large number of additional codes. Boucher et al. further extended this technique to skew constacyclic codes in [3]. Siap et al. [4] investigated skew cyclic codes of any length in 2011 and produced maps using both classical and quasi-cyclic codes.

In 2012, Jitman et al. [5] studied skew constacyclic codes over finite chain rings and described the algebraic structure of Euclidean and Hermitian dual codes. Abualrub et al. [6] studied $\theta$-cyclic codes over the semilocal ring ${\mathbb{F}}_2+u{\mathbb{F}}_2,v^2=v$ with respect to Euclidean and Hermitian inner products.

These codes over semilocal rings were further studied in many contexts. The rings ${\mathbb{F}}_3+v{\mathbb{F}}_3$ in [7], ${\mathbb{F}}_q+v{\mathbb{F}}_q,v^2=v$ in [8], and ${\mathbb{F}}_q+u{\mathbb{F}}_q+v{\mathbb{F}}_q,u^2=u,v^2=v,uv=vu=0$ in [9] were utilized as alphabets for skew cyclic codes, for example. Dertli and Cengellenmis [10] and Yao et al. [11] also examined these codes over ${\mathbb{F}}_q+u{\mathbb{F}}_q+v{\mathbb{F}}_q+uv{\mathbb{F}}_q,u^2=u,v^2=v,$ $uv=vu$. Skewed $(-1+2v)$-constacyclic codes were developed in 2017 by Gao et al. [12] after deriving the structure of skew constacyclic codes over the semilocal ring ${\mathbb{F}}_q+v{\mathbb{F}}_q,v^2=v$. In [13] and [14], respectively, Islam and Prakash established the algebraic structure of skew constacyclic codes over ${\mathbb{F}}_q+u{\mathbb{F}}_q+v{\mathbb{F}}_q+uv{\mathbb{F}}_q,u^2=u,v^2=v, uv=vu$.

Using two non-trivial automorphisms, Bhardwaj and Raka [15] investigated the skew constacyclic codes over the ring ${\mathbb{F}}_q[u,v]\langle f\left(u\right),g\left(v\right),uv-vu\rangle$ in 2019. Alternatively, ${\mathbb{Z}}_2{\mathbb{Z}}_4$-linear codes, or codes over the mixed alphabet ${\mathbb{Z}}_2{\mathbb{Z}}_4,$ where a subset of coordinates is binary and the complement is quaternary, were introduced by Borges et al. [16]. They have calculated their generator matrices and described their dual codes. Fernandez-Cordoba et al. [17] obtained the rank and kernel of ${\mathbb{Z}}_2{\mathbb{Z}}_4$-linear codes in a follow-up experiment. Steganography is one field in which these codes have found industrial use [18].

In [19], additive codes over the mixed alphabet ${\mathbb{Z}}_2{\mathbb{Z}}_{2^s}$ were examined. Next, Refs. [20,21,22,23] examined the mixed alphabet ${\mathbb{Z}}_p{\mathbb{Z}}_{p^s}$ and, more broadly, ${\mathbb{Z}}_{p^r}{\mathbb{Z}}_{p^s}$. Conversely, Abualrub et al. [24] defined ${\mathbb{Z}}_2{\mathbb{Z}}_4$ in 2014, in line with the advancement of cyclic codes on mixed alphabets. The code for -additive cyclics is ${\mathbb{Z}}_4\left[x\right]$.-submodule of ${\mathbb{Z}}_2\left[x\right]/\langle x^r-1\rangle \times {\mathbb{Z}}_4\left[x\right]/\langle x^s-1\rangle$, from which the smallest spanning set and unique set of generators for these codes, where s is an odd integer, were obtained.

Furthermore, generator polynomials and duals for ${\mathbf{Z}}_2{\mathbb{Z}}_4$-additive cyclic codes were discovered by Borges et al. [25]. In [26], Aydogdu et al. [27] introduced the novel mixed alphabets ${\mathbb{Z}}_2{\mathbb{Z}}_2\left[u\right]$-additive codes, where $u^2=0$. They also studied constacyclic codes over mixed alphabets by defining them as ${\mathbb{Z}}_2\left[u\right]\left[x\right].\times {\mathbb{Z}}_2\left[u\right]\left[x\right]/\langle x^{\beta }-(1+u)\rangle$, -submodules of ${\mathbb{Z}}_2\left[x\right]/\langle x^{\alpha }-1\rangle$.

As the Gray images of ${\mathbb{Z}}_2{\mathbb{Z}}_2\left[u\right]$-cyclic codes, they were able to derive several optimum binary linear codes. In the meanwhile, ${\mathbb{Z}}_2{\mathbb{Z}}_2\left[u\right]$-additive cyclic and constacyclic codes with the unit $1+u$, respectively, were explored algebraically by [28]. Consequently, the predicted generalization in the continuation of these research should be ${\mathbb{Z}}_{2^r}{\mathbb{Z}}_{2^s}\left[u\right]$.-additive cyclic codes, $u^2=0$, and constacyclic codes.

In this article, we examine a mixed alphabet $\mathcal{R}={\mathbb{F}}_q{\mathcal{R}}_1{\mathcal{R}}_2$, where ${\mathcal{R}}_1={\mathbb{F}}_q+u{\mathbb{F}}_q$ with $u^2=u$ and ${\mathcal{R}}_2={\mathbb{F}}_q+u{\mathbb{F}}_q+v{\mathbb{F}}_q$ with $u^2=u,v^2=v,uv=vu=0.$ Moreover, we examine the cyclic codes ${\theta }_t$ and $({\theta }_t,\alpha )$ over $\mathcal{R}.$ The algebraic structure of these codes is fully determined. We examine their q-ary representations under Gray maps and provide a few brief numerical instances.

The contents are arranged as follows. The next section gathers some background information. Gray maps are examined in Section 3. Skewed cyclic codes are covered in Section 4, and skew constacyclic codes are covered in Section 5. The essay is concluded at Section 6.

2. Preliminaries

Let p be an odd prime, and let $q=p^m$ with m being odd. Denote by ${\mathbb{F}}_q$ the finite field of size $q.$ The set ${\mathbb{F}}_q^n$ of all ordered n-tuples over ${\mathbb{F}}_q$ is equipped with the structure of an ${\mathbb{F}}_q$ vector space by the usual addition and scalar multiplication of vectors.

A code of length n over ${\mathbb{F}}_q$ is just any non-empty subset $\mathcal{C}\mathrm{of}{\mathbb{F}}_q^n.$ It is said to be linear if $\mathcal{C}$ is an ${\mathbb{F}}_q$ subspace of ${\mathbb{F}}_q^n.$ From now on, we write ${\mathcal{R}}_1={\mathbb{F}}_q+u{\mathbb{F}}_q,$ with $u^2=u$ and ${\mathcal{R}}_2={\mathbb{F}}_q+u{\mathbb{F}}_q+v{\mathbb{F}}_q,$ with $u^2=u,v^2=v,uv=vu=0.$

Note that ${\mathcal{R}}_1$ and ${\mathcal{R}}_2$ are finite non-chain rings. Let $a+ub+vc$ be an element of ${\mathcal{R}}_2.$ Then, we define two maps $\eta$ and $\delta$ as follows:

$$\begin{array}{ccc}\hfill \eta :{\mathcal{R}}_2\to {\mathbb{F}}_q,& & \delta :{\mathcal{R}}_2\to {\mathcal{R}}_1,\hfill \\ \hfill \eta (a+ub+vc)=a,& & \delta (a+ub+vc)=a+ub,\hfill \end{array}$$

It is clear that $\eta \mathrm{and}\delta$ are ring homomorphisms. We consider the ring $\mathcal{R}$:

$$\mathcal{R}={\mathbb{F}}_q{\mathcal{R}}_1{\mathcal{R}}_2=\{(x,y,z)\mid x\in {\mathbb{F}}_q,y\in {\mathcal{R}}_1\mathrm{and}z\in {\mathcal{R}}_2\}$$

We define a ${\mathcal{R}}_2$-multiplication in this ring as follows:

$$\begin{array}{ccc}\hfill ★:{\mathcal{R}}_2\times \mathcal{R}& \to & \mathcal{R}\hfill \\ \hfill r★(x,y,z)& =& \left(\eta \right(r)x,\delta (r)y,rz)\hfill \end{array}$$

This is a well defined multiplication and it can be extended componentwise to ${\mathcal{R}}_{⚪}={\mathbb{F}}_q^{n_1}\times {\mathcal{R}}_1^{n_2}\times {\mathcal{R}}_2^{n_3}$ by:

$$\begin{array}{ccc}\hfill ★:{\mathcal{R}}_2\times {\mathcal{R}}_{⚪}& \to & {\mathcal{R}}_{⚪}\hfill \\ \hfill r★(x_1,\cdots ,x_{n_1},y_1,\cdots ,y_{n_2},z_1,\cdots ,z_{n_3})& =& (\eta \left(r\right)x_1,\cdots ,\eta \left(r\right)x_{n_1},\delta \left(r\right)y_1,\cdots ,\delta \left(r\right)y_{n_2},r{z}_1,\cdots ,r{z}_{n_3})\hfill \end{array}$$

where $(x_1,\cdots ,x_{n_1},y_1,\cdots ,y_{n_2},z_1,\cdots ,z_{n_3})\in {\mathcal{R}}_{\gamma }.$ Equipped with this multiplication, ${\mathcal{R}}_{⚪}$ becomes an ${\mathcal{R}}_2\mathrm{module}.$ A non-empty subset $\mathcal{C}\mathrm{of}{\mathcal{R}}_{⚪}$ is said to be a $\mathcal{R}$-linear code of length $(n_1,n_2,n_3)$ if $\mathcal{C}\mathrm{is}\mathrm{an}{\mathcal{R}}_2-\mathrm{submodule}\mathrm{of}{\mathcal{R}}_{⚪}.$ Now we define the inner product by the formula:

$$\begin{array}{c}\hfill \langle c,c^{\prime }\rangle =\sum _1^{n_1}{x}_i{x}_i^{\prime }+\sum _1^{n_2}{y}_j{y}_j^{\prime }+\sum _1^{n_3}{z}_k{z}_k^{\prime },\end{array}$$

where $c=(x_1,\cdots ,x_{n_1},y_1,\cdots ,y_{n_2},z_1,\cdots ,z_{n_3}),c^{\prime }=(x_1^{\prime },\cdots ,x_{n_1}^{\prime },y_1^{\prime },\cdots ,y_{n_2}^{\prime },z_1^{\prime },\cdots ,z_{n_3}^{\prime })$ are in ${\mathcal{R}}_{\gamma }.$ Let $\mathcal{C}$ be an $\mathcal{R}$-linear code of length $(n_1,n_2,n_3).$ Then, the dual code of $\mathcal{C}$ is defined as:

$$\begin{array}{c}\hfill {\mathcal{C}}^{\perp }=\{c^{\prime }\in {\mathcal{R}}_{\gamma }\mid \langle c,c^{\prime }\rangle =0\forall c\in \mathcal{C}\}\end{array}$$

3. Decomposition and Properties of Gray Maps

Recall that, ${\mathcal{R}}_1={\mathbb{F}}_q+u{\mathbb{F}}_q,\mathrm{with}{u}^2=u.$ Consider the idempotent orthogonal elements $e_1=u$ and $e_2=1-u.$ Then, we have the decomposition:

$${\mathcal{R}}_1=e_1{\mathcal{R}}_1\oplus e_2{\mathcal{R}}_1\cong e_1{\mathbb{F}}_q\oplus e_2{\mathbb{F}}_q,$$

where $e_1{e}_2=0,e_1^2=e_1,e_1+e_2=1.$ Hence, ${\mathcal{R}}_1=\{a{e}_1+b{e}_2\mid a,b\mathrm{in}{\mathbb{F}}_q\}.$ We now define the Gray map:

$$\begin{array}{ccc}\hfill {\phi }_1:{\mathcal{R}}_1& \to & {\mathbb{F}}_q^2\hfill \\ \hfill {\phi }_1(a{e}_1+b{e}_2)& =& (a,b)\hfill \end{array}$$

It can be extended to the length n by:

$$\begin{array}{ccc}\hfill {\phi }_1:{\mathcal{R}}_1^n& \to & {\mathbb{F}}_q^{2n}\hfill \\ \hfill {\phi }_1((a_1,\cdots ,a_n)e_1+(b_1,\cdots ,b_n)e_2)& =& (a_1,\cdots ,a_n,b_1,\cdots ,b_n)\hfill \end{array}$$

Note that it is a linear map. We define the Gray weight of a codeword in ${\mathcal{R}}_1$ as:

$$w{t}_G(a{e}_1+b{e}_2)=w{t}_H(a,b)$$

where $w{t}_H$ denotes the Hamming weight. If $x,y\mathrm{lie}\mathrm{in}{\mathcal{R}}_1^n,$ then their mutual distance is given by:

$$d_G(x,y)=\sum _1^{n}w{t}_G(x_i-y_i)=\sum _1^{2n}w{t}_H({\phi }_1\left(x\right)-{\phi }_1\left(y\right))=d_H({\phi }_1\left(x\right),{\phi }_1\left(y\right)).$$

Hence, ${\phi }_1$ is a weight preserving map. A non-empty subset $\mathcal{C}\mathrm{of}{\mathcal{R}}_i^n$ is said to be a linear code of length n if $\mathcal{C}$ is ${\mathcal{R}}_i-\mathrm{submodule}\mathrm{of}{\mathcal{R}}_i^n.$

For $i\in \{1,2\},A_i\subseteq {\mathcal{R}}_1$:

$$A_1\oplus A_2=\{a_1+a_2\mid a_i\in A_i\}\mathrm{and}{A}_1\otimes A_2=\{(a_1,a_2)\mid a_i\in A_i\}.$$

Let ${\mathcal{C}}_e$ be a linear code of length n over ${\mathcal{R}}_1.$ Then, we define:

$${\mathcal{C}}_{e_1}=\{y_1\in {\mathbb{F}}_q^n\mid e_1{y}_1+e_2{y}_2\in {\mathcal{C}}_e,\mathrm{for}\mathrm{some}{y}_2\in {\mathbb{F}}_q^n\}$$

$${\mathcal{C}}_{e_2}=\{y_2\in {\mathbb{F}}_q^n\mid e_1{y}_1+e_2{y}_2\in {\mathcal{C}}_e,\mathrm{for}\mathrm{some}{y}_1\in {\mathbb{F}}_q^n\}$$

Therefore, any linear code ${\mathcal{C}}_e$ over ${\mathcal{R}}_1$ can be represented as ${\mathcal{C}}_e=e_1{\mathcal{C}}_{e_1}\oplus e_2{\mathcal{C}}_{e_2}$ and ${\phi }_1\left({\mathcal{C}}_e\right)={\mathcal{C}}_{e_1}\otimes {\mathcal{C}}_{e_2}.$ Hence, ${\mathcal{C}}_{e_1}$ and ${\mathcal{C}}_{e_2}$ are ${\mathbb{F}}_q$-linear codes. Also note that ${\phi }_1\left({\mathcal{C}}_e^{\perp }\right)={\phi }_1{\left({\mathcal{C}}_e\right)}^{\perp }.$

Recall that ${\mathcal{R}}_2={\mathbb{F}}_q+u{\mathbb{F}}_q+v{\mathbb{F}}_q,$ with $u^2=u,v^2=v,uv=vu=0.$ Let $o_1=(1-u-v),o_2=u,o_3=v$ be idempotent orthogonal elements in ${\mathcal{R}}_2,$ then:

$${\mathcal{R}}_2=o_1{\mathcal{R}}_2\oplus o_2{\mathcal{R}}_2\oplus o_3{\mathcal{R}}_2\cong o_1{\mathbb{F}}_q\oplus o_2{\mathbb{F}}_q\oplus o_2{\mathbb{F}}_q,$$

where $o_i{o}_j=0(i\ne j),o_i^2=o_i,o_1+o_2+o_3=1.$ Hence, any element in ${\mathcal{R}}_2$ can be written as $a{o}_1+b{o}_2+o_3{c}_3.$ We now define a weight preserving linear Gray map ${\phi }_2,$:

$$\begin{array}{ccc}\hfill {\phi }_2:{\mathcal{R}}_2& \to & {\mathbb{F}}_q^3\hfill \\ \hfill {\phi }_2(a{o}_1+b{o}_2+c{o}_3)& =& (a,b,c)\hfill \end{array}$$

It can be extended to length n by the formula:

$$\begin{array}{c}\hfill {\phi }_2((a_1,\cdots ,a_n)o_1+(b_1,\cdots ,b_n)o_2+(c_1,\cdots ,c_n)o_2)=(a_1,\cdots ,a_n,b_1,\cdots ,b_n,c_1,\cdots ,c_n).\end{array}$$

We define the Gray weight of a codeword in ${\mathcal{R}}_2$ as:

$$w{t}_G(a{o}_1+b{o}_2+c{o}_3)=w{t}_H(a,b,c)$$

where $w{t}_H$ denotes the Hamming weight. If $x,y\mathrm{are}\mathrm{in}{\mathcal{R}}_2^n,$ then their Gray distance is given by:

$$d_G(x,y)=\sum _1^{n}w{t}_G(x_i-y_i)=\sum _1^{3n}w{t}_H({\phi }_2\left(x\right)-{\phi }_2\left(y\right))=d_H({\phi }_2\left(x\right),{\phi }_2\left(y\right)).$$

For $i\in \{1,2,3\},A_i\subseteq {\mathcal{R}}_2$:

$$A_1\oplus A_2\oplus A_3=\{a_1+a_2+a_3\mid a_i\in A_i\}\mathrm{and}{A}_1\otimes A_2\otimes A_3=\{(a_1,a_2,a_3)\mid a_i\in A_i\}.$$

Let ${\mathcal{C}}_o$ be a linear code of length n over ${\mathcal{R}}_2.$ We define the three codes:

$$\begin{array}{ccc}\hfill {\mathcal{C}}_{o_1}& =& \{z_1\in {\mathbb{F}}_q^n\mid o_1{z}_1+o_2{z}_2+o_3{z}_3\in {\mathcal{C}}_o,\mathrm{for}\mathrm{some}{z}_2,z_3\in {\mathbb{F}}_q^n\},\hfill \\ \hfill {\mathcal{C}}_{o_2}& =& \{z_2\in {\mathbb{F}}_q^n\mid o_1{z}_1+o_2{z}_2+o_3{z}_3\in {\mathcal{C}}_o,\mathrm{for}\mathrm{some}{z}_1,z_3\in {\mathbb{F}}_q^n\},\hfill \\ \hfill {\mathcal{C}}_{o_3}& =& \{z_3\in {\mathbb{F}}_q^n\mid o_1{z}_1+o_2{z}_2+o_3{z}_3\in {\mathcal{C}}_o,\mathrm{for}\mathrm{some}{z}_1,z_2\in {\mathbb{F}}_q^n\}.\hfill \end{array}$$

Then, any linear code ${\mathcal{C}}_o$ over ${\mathcal{R}}_2$ can be represented as ${\mathcal{C}}_o=o_1{\mathcal{C}}_{o_1}\oplus o_2{\mathcal{C}}_{o_2}\oplus o_3{\mathcal{C}}_{o_3}$ and ${\phi }_2\left({\mathcal{C}}_o\right)={\mathcal{C}}_{o_1}\otimes {\mathcal{C}}_{o_2}\otimes {\mathcal{C}}_{o_3},\mathrm{where}{\mathcal{C}}_{o_1},{\mathcal{C}}_{o_2}$, and ${\mathcal{C}}_{o_3}$ are ${\mathbb{F}}_q$-linear codes. Also note that ${\phi }_2\left({\mathcal{C}}_o^{\perp }\right)={\phi }_2{\left({\mathcal{C}}_o\right)}^{\perp }.$

Henceforth, we define the Gray map $\phi \mathrm{on}\mathcal{R}$ using the maps defined previously:

$$\begin{array}{ccc}\hfill \phi :\mathcal{R}& \to & {\mathbb{F}}_q^6\hfill \\ \hfill \phi (x,y,z)& =& (x,{\phi }_1\left(y\right),{\phi }_2\left(z\right))\hfill \end{array}$$

now we can extend this map to ${\mathcal{R}}_{\gamma }$:

$$\begin{array}{c}\hfill \phi (x_1,\cdots ,x_{n_1},y_1,\cdots ,y_{n_2},z_1,\cdots ,z_{n_3})=(x_1,\cdots ,x_{n_1},{\phi }_1\left(y_1\right),\cdots ,{\phi }_1\left(y_{n_2}\right),{\phi }_2\left(z_1\right),\cdots ,{\phi }_2\left(z_{n_3}\right))\end{array}$$

then, the Gray weight of an element in ${\mathcal{R}}_{\gamma }$ can be denoted by $w{t}_G\left(\alpha \right)=w{t}_H\left(\phi \left(\alpha \right)\right)$. Any linear code $\mathcal{C}$ of ${\mathcal{R}}_{\gamma }$ can be represented by $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o,$ where ${\mathcal{C}}_1,{\mathcal{C}}_e,\mathrm{and}{\mathcal{C}}_o$ are linear code over ${\mathbb{F}}_q,{\mathcal{R}}_1,\mathrm{and}{\mathcal{R}}_2.$ Let $G_{{\mathbb{F}}_q}$ be the generator matrix for linear code over ${\mathbb{F}}_q.$ The generator matrix $G_{{\mathcal{R}}_1}$ for a linear code over ${\mathcal{R}}_1$ is denoted by:

$$G_{{\mathcal{R}}_1}=\left[\begin{array}{c}{e}_1{G}_{e_1}\\ e_2{G}_{e_2}\end{array}\right]$$

where $G_{e_i}$ is the generator matrix for the linear code ${{\mathcal{C}}_e}_i,\mathrm{for}i=\{1,2\}.$ The generator matrix $G_{{\mathcal{R}}_2}$ for the linear code over ${\mathcal{R}}_2$ is:

$$G_{{\mathcal{R}}_2}=\left[\begin{array}{c}{o}_1{G}_{o_1}\\ o_2{G}_{o_2}\\ o_3{G}_{o_3}\end{array}\right]$$

where $G_{o_i}$ is the generator matrix for the linear code ${{\mathcal{C}}_o}_i,\mathrm{for}i=\{1,2,3\}.$ Using the generator matrices above, we can say that the generator matrix G for the linear code over $\mathcal{R}$ is:

$$G=\left[\begin{array}{ccc}{G}_{{\mathbb{F}}_q}& 0& 0\\ 0& G_{{\mathcal{R}}_1}& 0\\ 0& 0& G_{{\mathcal{R}}_2}\end{array}\right].$$

Note that the minimum distance of $\mathcal{C}$ is min$\{d_H\left({\mathcal{C}}_1\right),d_H\left({\phi }_1\left({\mathcal{C}}_e\right)\right),d_H\left({\phi }_2\left({\mathcal{C}}_o\right)\right)\}.$ The following theorem provides the weight preserving nature of the Gray map.

Theorem 1.

The Gray map φ defined above is linear and weight preserving.

Proof. 

Let $x=(x_1,x_2,x_3),x^{\prime }=(x_1^{\prime },x_2^{\prime },x_3^{\prime })\mathrm{be}\mathrm{in}{\mathcal{R}}_{\gamma }$ where $x_1,x_1^{\prime }\in {\mathbb{F}}_q^{n_1},x_2,x_2^{\prime }\in {\mathcal{R}}_1^{n_2},x_3,$$x_3^{\prime }\in {\mathcal{R}}_2^{n_3}.$ We have:

$$\begin{array}{ccc}\hfill \phi (x+x^{\prime })& =& \phi (x_1+x_1^{\prime },x_2+x_2^{\prime },x_3+x_3^{\prime })\hfill \\ & =& (x_1+x_1^{\prime },{\phi }_1(x_2+x_2^{\prime }),{\phi }_2(x_3+x_3^{\prime }))\hfill \\ & =& (x_1,{\phi }_1\left(x_2\right),{\phi }_2\left(x_3\right))+(x_1^{\prime },{\phi }_1\left(x_2^{\prime }\right),{\phi }_2\left(x_3^{\prime }\right))(\because {\phi }_1\mathrm{and}{\phi }_2\mathrm{are}\mathrm{linear})\hfill \\ & =& \phi \left(x\right)+\phi \left(x^{\prime }\right)\hfill \end{array}$$

Using the linear map $\phi ,$

$$d_G(x,x^{\prime })=w{t}_G(x-x^{\prime })=w{t}_H(\phi \left(x\right)-\phi \left(x^{\prime }\right))=d_H(\phi \left(x\right),\phi \left(x^{\prime }\right))$$

Hence, $\phi$ is a weight preserving linear map. □

The following theorem gives the parameters of the Gray image of a linear code.

Theorem 2.

If $\mathcal{C}\subseteq {\mathcal{R}}_{\gamma }$ is an $(n_1+n_2+n_3,d_G)$ linear code then $\phi \left(\mathcal{C}\right)$ is an $(n_1+2\left(n_2\right)+3\left(n_3\right),d_H)$ linear code over ${\mathbb{F}}_q,$ where $d_G=d_H.$

Proof. 

The proof can extended from the proof of Theorem 1. □

The following Theorem characterizes $\phi \left(\mathcal{C}\right)$:

Theorem 3.

If $\mathcal{C}\subseteq {\mathcal{R}}_{\gamma }$ is linear, then $\phi \left(\mathcal{C}\right)={\mathcal{C}}_1{\otimes }_{i=1}^{i=2}{\mathcal{C}}_{e_i}{\otimes }_{j=1}^{j=3}{\mathcal{C}}_{o_j},\mid \mathcal{C}\mid =\mid {\mathcal{C}}_1\mid {\prod }_{i=1}^{i=2}\mid {\mathcal{C}}_{e_i}\mid {\prod }_{j=1}^{j=3}\mid {\mathcal{C}}_{o_j}\mid$.

Proof. 

Let:

$$\phi (x,y,z)=(x,{\phi }_1\left(y\right),{\phi }_3\left(z\right))=(a_1,\cdots ,a_6)\in \phi \left(\mathcal{C}\right)\subseteq {\mathbb{F}}_q^6.$$

Note that $\phi$ is bijective and $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o$ is linear. Thus, $a_1=x\in {\mathcal{C}}_1.\mathrm{Also}\mathrm{note}\mathrm{that}{\phi }_1\left(y\right)=(a_2,a_3),{\phi }_2\left(z\right)=(a_4,a_5,a_6).\mathrm{Sin}\mathrm{ce}{\phi }_i^{\prime }s$ are bijective, $a_2{e}_1+a_3{e}_2\in e_1{\mathcal{C}}_{e_1}\oplus e_2{\mathcal{C}}_{e_2}={\mathcal{C}}_e.$ Hence, $(a_2,a_3)\in {\mathcal{C}}_{e_1}\otimes {\mathcal{C}}_{e_2}$ and similarly $(a_4,a_5,a_6)\in {\mathcal{C}}_{o_1}\otimes {\mathcal{C}}_{o_2}\otimes {\mathcal{C}}_{o_2}.$ The converse holds in a similar way. The second part of the statement follows from the fact that $\phi$ is bijective. □

The following Theorem furnishes the decompostion of the dual of the linear code $\mathcal{C}.$

Theorem 4.

If $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o$ is a linear code over $\mathcal{R}\mathrm{then}{\mathcal{C}}^{\perp }={\mathcal{C}}_1^{\perp }\otimes {\mathcal{C}}_e^{\perp }\otimes {\mathcal{C}}_o^{\perp },\mathrm{where}{\mathcal{C}}_1^{\perp },$${\mathcal{C}}_e^{\perp }$ and ${\mathcal{C}}_o^{\perp }$ are duals for the respective linear codes.

Proof. 

Let ${\mathcal{C}}^{\perp }=\{c^{\prime }\in {\mathcal{R}}_{\gamma }|\langle c,c^{\prime }\rangle =0\mathrm{for}\mathrm{all}c\in \mathcal{C}\}=\{(x^{\prime },y^{\prime },z^{\prime })\in {\mathcal{R}}_{⚪}|x^{\prime }\in {\mathbb{F}}_q^{n_1},$$y^{\prime }\in {\mathcal{R}}_1^{n_2},z^{\prime }\in {\mathcal{R}}_2^{n_3}\}.$ Let $c=(x,y,z)\in \mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o.$ Then:

$$\langle c,c^{\prime }\rangle =x{x}^{\prime }+y{y}^{\prime }+z{z}^{\prime }=0.$$

Thus, $x^{\prime }\in {\mathcal{C}}_1^{\perp },y^{\prime }\in {\mathcal{C}}_e^{\perp },z^{\prime }\in {\mathcal{C}}_o^{\perp }\mathrm{and}\mathrm{so}{\mathcal{C}}^{\perp }\subseteq {\mathcal{C}}_1^{\perp }\otimes {\mathcal{C}}_e^{\perp }\otimes {\mathcal{C}}_o^{\perp }.\mathrm{Since}|{\mathcal{C}}^{\perp }|=|{\mathcal{C}}_1^{\perp }\left|\right|{\mathcal{C}}_e^{\perp }\left|\right|{\mathcal{C}}_o^{\perp }|,$ the statement holds.

□

The next result shows that the Gray maps is compatible with duality.

Theorem 5.

If $\mathcal{C}\subseteq {\mathcal{R}}_{\gamma }$ is linear, then $\phi \left({\mathcal{C}}^{\perp }\right)=\phi {\left(\mathcal{C}\right)}^{\perp }.$

Proof. 

Let $(x,y,z)\in \mathcal{C}$ and $(x^{\prime },y^{\prime },z^{\prime })\in {\mathcal{C}}^{\perp }$, where $x\in {\mathcal{C}}_1,y\in {\mathcal{C}}_e,z\in {\mathcal{C}}_o$ and $x^{\prime }\in {\mathcal{C}}_1^{\perp },y^{\prime }\in {\mathcal{C}}_e^{\perp },z^{\prime }\in {\mathcal{C}}_o^{\perp },$ then $\langle \left(x\right|y|z,x^{\prime }|y^{\prime }|z^{\prime })\rangle =0.$ Using Theorem 4, ${\mathcal{C}}_1^{\perp },{\mathcal{C}}_e^{\perp }\mathrm{and}{\mathcal{C}}_o^{\perp }$ are duals for ${\mathcal{C}}_1,{\mathcal{C}}_e,\mathrm{and}{\mathcal{C}}_o.$ Now, we have $\phi (x,y,z)=(x,{\phi }_1\left(y\right),{\phi }_2\left(z\right)),\phi (x^{\prime },y^{\prime },z^{\prime })=(x^{\prime },{\phi }_1\left(y^{\prime }\right),{\phi }_2\left(z^{\prime }\right)),$ then the inner product is given by:

$$\begin{array}{ccc}\hfill \langle \phi (x,y,z),\phi (x^{\prime },y^{\prime },z^{\prime })\rangle & =& \langle (x,{\phi }_1\left(y\right),{\phi }_2\left(z\right)),(x^{\prime },{\phi }_1\left(y^{\prime }\right),{\phi }_2\left(z^{\prime }\right))\rangle \hfill \\ & =& \langle (x,0,0),(x^{\prime },0,0)\rangle +\langle (0,{\phi }_1\left(y\right),0),(0,{\phi }_1\left(y^{\prime }\right),0)\rangle \hfill \\ \hfill & & +\langle (0,0,{\phi }_2\left(z\right)),(0,0,{\phi }_2\left(z^{\prime }\right))\rangle \hfill \\ & =& 0(\because {\phi }_1\left(C^{\perp }\right)={\phi }_1{\left(C\right)}^{\perp },{\phi }_2\left(C^{\perp }\right)={\phi }_2{\left(C\right)}^{\perp })\hfill \end{array}$$

Thus, $\phi \left({\mathcal{C}}^{\perp }\right)\subseteq \phi {\left(\mathcal{C}\right)}^{\perp }.$ Since the cardinality is the same on both sides, the statement holds. □

The following result provides the self duality nature of the linear code and its Gray image.

Corollary 1.

If $\mathcal{C}$ is a linear ${\mathcal{R}}_{\gamma }$-code, then $\mathcal{C}$ is self-dual iff $\phi \left(C\right)$ is self-dual. Moreover, $\phi \left(C\right)$ is a self-orthogonal code over ${\mathbb{F}}_q$ iff C is self-orthogonal.

Proof. 

Let $\mathcal{C}$ be a self-dual linear code of length n over $\mathcal{R}$. Thus, $\mathcal{C}={\mathcal{C}}^{\perp }$. Then, $\phi \left(C\right)=\phi \left(C^{\perp }\right)$, and hence, by Theorem 5, we have $\phi \left(\mathcal{C}\right)={\left(\phi \left(\mathcal{C}\right)\right)}^{\perp }$. Thus, $\phi \left(\mathcal{C}\right)$ is a self-dual linear code of length $n_1+2n_2+3n_3$ over ${\mathbb{F}}_q$. Conversely, let $\phi \left(\mathcal{C}\right)$ be a self-dual linear code of length $n_1+2n_2+3n_3$ over ${\mathbb{F}}_q$. Then, $\phi \left(C\right)={\left(\phi \left(\mathcal{C}\right)\right)}^{\perp }$, and hence, by Theorem 5, we have $\phi \left(\mathcal{C}\right)=\phi \left({\mathcal{C}}^{\perp }\right)$. Since $\phi$ is bijection, $\mathcal{C}={\mathcal{C}}^{\perp }$. Therefore, $\mathcal{C}$ is a self-dual linear code over ${\mathcal{R}}_{\gamma }$. Similarly, the self orthogonal case holds. □

4. Skew Cyclic $\mathcal{R}$-Codes

Let ${\theta }_t$ be a non-trivial Frobenius automorphism defined by:

$${\theta }_t:{\mathbb{F}}_q\to {\mathbb{F}}_q,{\theta }_t\left(a\right)=a^{p^t},$$

where t divides $m.$ It can be extended to ${\mathcal{R}}_1$ and ${\mathcal{R}}_2$ by:

$${\theta }_t(a+ub)={\theta }_t\left(a\right)+u{\theta }_t\left(b\right),{\theta }_t(a+ub+vc)={\theta }_t\left(a\right)+u{\theta }_t\left(b\right)+v{\theta }_t\left(b\right).$$

Since $t|m,$ the order of automorphism ${\theta }_t\mathrm{is}\frac{m}{t}.$ We define a polynomial ring ${\mathcal{R}}_i[x,{\theta }_t]$$(1\le i\le 2)$ as follows:

$${\mathcal{R}}_i[x,{\theta }_t]=\{a_1+\cdots +a_n{x}^n|a_j\in {\mathcal{R}}_i,1\le j\le n\}$$

Clearly, ${\mathcal{R}}_i[x,{\theta }_t]$ is a ring with respect to usual addition and the multiplication defined by:

$$a{x}^{m}b{x}^n=a{\theta }_t^m\left(b\right)x^{m+n}$$

Note that it is a non-commutative ring unless ${\theta }_t$ is an identity map. A non-empty set $\mathcal{C}$ is said to be a linear code of length $n_i$ over ${\mathcal{R}}_i$ if it is a ${\mathcal{R}}_i$ submodule of ${\mathcal{R}}_i^{n_i}.$ Using the above polynomial rings above, we extend the polynomial ring to $\mathcal{R}$ by:

$$\mathcal{R}[x,{\theta }_t]=\{(a\left(x\right),b\left(x\right),c\left(x\right)):a\left(x\right)\in {\mathbb{F}}_q\left[x\right],b\left(x\right)\in {\mathcal{R}}_1\left[x\right],c\left(x\right)\in {\mathcal{R}}_2\left[x\right]\}.$$

It can be seen that $\mathcal{R}[x,{\theta }_t]$ is a ${\mathcal{R}}_2[x;{\theta }_t]$ submodule with respect to usual addition and multiplication defined by:

$$\begin{array}{ccc}\hfill ★:{\mathcal{R}}_2\left[x\right]\times \mathcal{R}[x,{\theta }_t]& \to & \mathcal{R}[x,{\theta }_t]\hfill \\ \hfill \left(a{x}^s\right)★(b_1{x}^i,b_2{x}^j,b_3{x}^k)& =& (\eta \left(a\right)x^s{b}_1{x}^i,\delta \left(a\right)x^s{b}_2{x}^j,a{x}^s{b}_3{x}^k)\hfill \\ & =& (\eta \left(a\right){\theta }_t^s\left(b_1\right)x^{s+i},\delta \left(a\right){\theta }_t^s\left(b_2\right)x^{s+j},a{\theta }_t^s\left(b_3\right)x^{s+k})\hfill \end{array}$$

However, under associative and distributive laws, the multiplication can be extended to ${\mathcal{R}}_{\gamma }[x;{\theta }_t]=\frac{F_q[x;{\theta }_t]}{\langle x^{n_1}-1\rangle }\times \frac{R_1[x;{\theta }_t]}{\langle x^{n_2}-1\rangle }\times \frac{R_2[x;{\theta }_t]}{\langle x^{n_3}-1\rangle }$ as follows:

$$★:{\mathcal{R}}_2[x;{\theta }_t]\times R_{\gamma }[x;{\theta }_t]\to R_{\gamma }[x;{\theta }_t]$$

$$r\left(x\right)★(f_1\left(x\right)+\langle x^{n_1}-1\rangle ,f_2\left(x\right)+\langle x^{n_2}-1\rangle ,f_3\left(x\right)+\langle x^{n_3}-1\rangle )=(\eta \left(r\left(x\right)\right)f_1\left(x\right)+\langle x^{n_1}-1\rangle ,\delta \left(r\left(x\right)\right)f_2\left(x\right)+\langle x^{n_2}-1\rangle ,$$

$$r\left(x\right)f_3\left(x\right)+\langle x^{n_3}-1\rangle ).$$

Definition 1

([2]). We say that an $\mathcal{R}$-submodule $\mathcal{C}$ of ${\mathcal{R}}^n$ is a ${\theta }_t$-cyclic code if for any $c=(c_0,c_1,\cdots ,c_{n-1})\in C$, ${\sigma }_1\left(c\right)=({\theta }_t\left(c_{n-1}\right),{\theta }_t\left(c_0\right),\cdots ,{\theta }_t\left(c_{n-2}\right))\in \mathcal{C}$. The operator ${\sigma }_1$ is then said to be a ${\theta }_t$-cyclic shift operator on ${\mathcal{R}}^n$.

Definition 2.

A non-trivial ${\mathcal{R}}_2$-submodule $\mathcal{C}$ of ${\mathcal{R}}_{\gamma }$ is called a ${\theta }_t$-cyclic code if for any $c=(c_{0,1},c_{1,1},\cdots ,c_{n_1-1,1},c_{0,e},c_{1,e},\cdots ,c_{n_2-1,e},c_{0,o},c_{1,o},\cdots ,c_{n_3-1,o})\in \mathcal{C}$, $\sigma \left(c\right)=(\theta \left(c_{n_1-1,1}\right),\theta \left(c_{0,1}\right),\cdots ,\theta \left(c_{n_1-2,1}\right),\theta \left(c_{n_2-1,e}\right),\theta \left(c_{0,e}\right),\cdots ,\theta \left(c_{n_2-2,e}\right),\theta \left(c_{n_3-1,o}\right),\theta \left(c_{0,o}\right),\cdots ,\theta \left(c_{n_3-2,o}\right))\in \mathcal{C}$. The operator σ is called a ${\theta }_t$-cyclic shift operator on ${\mathcal{R}}^n$.

The following result yields the relationship between the ${\theta }_t$-cyclic codes over $\mathcal{R}\mathrm{and}{\mathbb{F}}_q$.

Theorem 6.

Let $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o\subseteq {\mathcal{R}}_{\gamma }$ be linear. Then $\mathcal{C}$ is a ${\theta }_t$-cyclic code if and only if ${\mathcal{C}}_1,{\mathcal{C}}_e$ and ${\mathcal{C}}_o$ are ${\theta }_t$-cyclic codes of length $n_1,n_2$ and $n_3$ over ${\mathbb{F}}_q,{\mathcal{R}}_1$ and ${\mathcal{R}}_2$ respectively.

Proof. 

Let $C={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o$ be a ${\theta }_t$-cyclic code over $\mathcal{R}$. Let $z=(z_1,z_e,z_o)\in \mathcal{C},$ that is:

$$\begin{array}{cc}\hfill & z=(z_{0,1},z_{1,1},\cdots ,z_{n_1-1,1},z_{0,e},z_{1,e},\cdots ,z_{n_2-1,e},z_{0,o},z_{1,o},\cdots ,z_{n_3-1,o})\in \mathcal{C}.\hfill \end{array}$$

Then, $\sigma \left(z\right)=(\theta \left(z_{n_1-1,1}\right),\theta \left(z_{0,1}\right),\cdots ,\theta \left(z_{n_1-2,1}\right),\theta \left(z_{n_2-1,e}\right),\theta \left(z_{0,e}\right),\cdots ,\theta \left(z_{n_2-2,e}\right),$$\theta \left(z_{n_3-1,o}\right),\theta \left(z_{0,o}\right),\cdots ,\theta \left(z_{n_3-2,o}\right))=(\sigma \left(z_1\right),\sigma \left(z_e\right),\sigma \left(z_o\right))\in \mathcal{C}$. From this, we can conclude that:

$$\begin{array}{c}\hfill \sigma \left(z_1\right)\in {\mathcal{C}}_1,\sigma \left(z_e\right)\in {\mathcal{C}}_e\mathrm{and}\sigma \left(z_o\right)\in {\mathcal{C}}_o\end{array}$$

Hence, ${\mathcal{C}}_1,{\mathcal{C}}_e$, and ${\mathcal{C}}_o$ are ${\theta }_t$-cyclic code of length $n_i.$ The converse holds in a similar way.

□

We recall the following Theorem from [9].

Theorem 7.

([9]). Let ${\mathcal{C}}_o=o_1{\mathcal{C}}_{o_1}\oplus o_2{\mathcal{C}}_{o_2}\oplus o_3{\mathcal{C}}_{o_3}$ be a linear code over ${\mathcal{R}}_2$ of length $n_3$, then ${\mathcal{C}}_o$ is ${\theta }_t$-cyclic code iff ${\mathcal{C}}_{o_i}(1\le i\le 3)$ is a ${\theta }_t$-cyclic code of length $n_3$ over ${\mathbb{F}}_q.$

The analogue of this result in our setting is as follows.

Theorem 8.

([8]). Let ${\mathcal{C}}_e=e_1{\mathcal{C}}_{e_1}\oplus e_2{\mathcal{C}}_{e_2}$ be a linear code over ${\mathcal{R}}_1$ of length $n_2$ then ${\mathcal{C}}_e$ is ${\theta }_t$-cyclic code iff ${\mathcal{C}}_{e_i}(1\le i\le 2)$ is a ${\theta }_t$-cyclic code of length $n_2$ over ${\mathbb{F}}_q.$

Theorem 9.

If $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o$ is a linear code of length $\gamma =n_1+n_2+n_3$, then $\mathcal{C}$ is ${\theta }_t$-cyclic iff ${\mathcal{C}}_1,{\mathcal{C}}_{e_i},{\mathcal{C}}_{o_j}(1\le i\le 2,1\le j\le 3)$ are ${\theta }_t$-cyclic code of length $n_1,n_2,n_3$ over ${\mathbb{F}}_q$ respecively.

Proof. 

We obtain the proof on combining proofs of Theorems 6–8. □

These notions are well-behaved with respect to duality as the next result shows.

Theorem 10.

If $\mathcal{C}$ is a ${\theta }_t$-cyclic code of length $n,$ then its dual ${\mathcal{C}}^{\perp }$ is also a ${\theta }_t$-cyclic code.

Proof. 

From Theorem 9, ${\mathcal{C}}_1,{\mathcal{C}}_{e_i},{\mathcal{C}}_{o_j}(1\le i\le 2,1\le j\le 3)$ are ${\theta }_t$-cyclic codes over ${\mathbb{F}}_q.$ Then, ${\mathcal{C}}_1^{\perp },{\mathcal{C}}_{e_i}^{\perp },{\mathcal{C}}_{o_j}^{\perp }(1\le i\le 2,1\le j\le 3)$ are ${\theta }_t$-cyclic codes over ${\mathbb{F}}_q$ from [29] and once again by using Theorem 9, ${\mathcal{C}}^{\perp }$ becomes a ${\theta }_t$-cylic code. □

Recall the following result from [4].

Lemma 1

([4]). Let C be a ${\theta }_t$-cyclic code of length n over ${\mathbb{F}}_q$. Then, there exists a polynomial $f\left(x\right)\in {\mathbb{F}}_q[x;{\theta }_t]$ such that $C=\langle f\left(x\right)\rangle$ and $x^n-1=g\left(x\right)f\left(x\right)$ in ${\mathbb{F}}_q[x;{\theta }_t]$.

By assuming $o\left({\theta }_t\right)|n,$ the counterpart follows.

Theorem 11.

Let $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o$ be a ${\theta }_t$-cyclic code of length n over $\mathcal{R}$ and assume that the order of ${\theta }_t$ divides $n.$ Then, $\mathcal{C}=\langle B_1,B_e,B_o\rangle$, where $B_1=\langle (f_1\left(x\right),0,0)\rangle ,B_e=\langle (0,f_e\left(x\right),0)\rangle ,$ and $B_o=\langle (b_1\left(x\right),b_e\left(x\right),f_o\left(x\right))\rangle ,$ such that ${\mathcal{C}}_1=\langle f_1\left(x\right)\rangle ,{\mathcal{C}}_e=\langle f_e\left(x\right)\rangle ,{\mathcal{C}}_o=\langle f_o\left(x\right)\rangle ,b_1\left(x\right)\in {\mathcal{C}}_1$$\mathrm{and} b_2\left(x\right)\in {\mathcal{C}}_e.$

Proof. 

Let $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o$ be a ${\theta }_t$-cyclic code of length $\gamma =n_1+n_2+n_3$ over $\mathcal{R}$. Then, by Thereom 6, ${\mathcal{C}}_1,{\mathcal{C}}_e,{\mathcal{C}}_o$ are ${\theta }_t$-cyclic codes of length $n_i$ over ${\mathbb{F}}_q,{\mathcal{R}}_1$ and ${\mathcal{R}}_2$. Define a homomorphism from $\mathcal{C}$ to $\mathcal{R}$ as follows:

$$\begin{array}{ccc}\hfill \psi :\mathcal{C}& \mapsto & \mathcal{R}\hfill \\ \hfill \psi (c_1\left(x\right),c_e\left(x\right),c_o\left(x\right))& =& (0,0,c_o\left(x\right))\hfill \end{array}$$

Define:

$$ker\left(\psi \right)=\{(c_1\left(x\right),c_e\left(x\right),0):c_1\left(x\right)\in {\mathcal{C}}_1,c_e\left(x\right)\in {\mathcal{C}}_e\}$$

$$\mathcal{I}=\{(c_1\left(x\right),c_e\left(x\right))\in {\mathbb{F}}_q[x;{\theta }_t]\times {\mathcal{R}}_1[x;{\theta }_t]:(c_1\left(x\right),c_e\left(x\right),0)\in \ker \left(\psi \right)\}.$$

Clearly, $\mathcal{I}={\mathcal{I}}_1\times {\mathcal{I}}_e$ forms a submodule of ${\mathbb{F}}_q[x;{\theta }_t]\times {\mathcal{R}}_1[x;{\theta }_t].$ Therefore, there exist a polynomial $f_1\left(x\right)$ and $f_e\left(x\right)$ in ${\mathbb{F}}_q[x;{\theta }_t]$ and ${\mathcal{R}}_1[x;{\theta }_t]$, respectively, generating ${\mathcal{I}}_1$ and ${\mathcal{I}}_e$ with $f_1\left(x\right)|x^{n_1}-1$ and $f_e\left(x\right)|x^{n_e}-1.$ Thus, $\mathcal{I}=\langle (f_1\left(x\right),0),(0,f_e\left(x\right))\rangle ,$ then for any $(c_1\left(x\right),c_e\left(x\right),0)\in \ker \left(\psi \right),$$(c_1\left(x\right),c_e\left(x\right))=v\left(x\right)★(f_1\left(x\right),0),(0,f_e\left(x\right))$ for some $v\left(x\right)\in {\mathcal{R}}_1[x;{\theta }_t].$ Finally, it leads to ker$\left(\psi \right)=\langle (f_1\left(x\right),0,0),(0,f_e\left(x\right),0)\rangle .$ The fact that $\mathcal{C}$ is a submodule implies that $\psi \left(\mathcal{C}\right)$ is a submodule. By using the first isomorphism theorem:

$$\begin{array}{c}\hfill \mathcal{C}/ker\left(\psi \right)\cong \psi \left(\mathcal{C}\right).\end{array}$$

Let $(b_1\left(x\right),b_e\left(x\right),f_o\left(x\right))\in \mathcal{C}$, then $\psi (b_1\left(x\right),b_e\left(x\right),f_o\left(x\right))=(0,0,f_o\left(x\right)).$ From this, any ${\theta }_t$-cyclic code of length n can be represented by $\mathcal{C}=\langle (f_1\left(x\right),0,0)(0,f_e\left(x\right),0),(b_1\left(x\right),b_e\left(x\right),f_o\left(x\right))\rangle$, where $f_1\left(x\right)|(x^{n_1}-1),f_e\left(x\right)|(x^{n_2}-1)$ and $f_o\left(x\right)|(x^{n_3}-1).$ □

Furthermore, we have $\mathcal{C}$ is ${\theta }_t$-cyclic, then ${\mathcal{C}}_k$, where $k\in \{1,e_1,e_2,o_1,o_2,o_3\}$ is skew ${\theta }_t$-cyclic code over ${\mathbb{F}}_q$ with respective lengths. From Theorem 3, $\left|\mathcal{C}\right|=\mid {\mathcal{C}}_1\mid {\prod }_{i=1}^{i=2}\mid C_{e_i}\mid {\prod }_{j=1}^{j=3}\mid C_{o_j}\mid$, since each ${\mathcal{C}}_k$ is ${\theta }_t$-cyclic it is generated by a polynomial $f_k\left(x\right)$, and thus, $\left|\mathcal{C}\right|=q^{\gamma -{\sum }_{i=1}^6{ϵ}_k}$, where $\gamma =n_1+2\left(n_2\right)+3\left(n_3\right).$ The following Theorem provides the generator polynomials for ${\theta }_t$-cylic codes over ${\mathbb{F}}_q.$

Theorem 12.

Let $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o$ be a skew cyclic code over $\mathcal{R}$ of length $\gamma =n_1+n_2+n_3$. Then, there exists a polynomial:

(i) 

$f_1\left(x\right)\in {\mathbb{F}}_q[x;{\theta }_t]$ such that ${\mathcal{C}}_1=\langle f_1\left(x\right)\rangle$ and $x^{n_1}-1=g_1\left(x\right)f_1\left(x\right)$.

(ii) 

$f_e\left(x\right)\in {\mathcal{R}}_1[x;{\theta }_t]$ such that ${\mathcal{C}}_e=\langle f_e\left(x\right)\rangle$ and $x^{n_2}-1=g_e\left(x\right)f_e\left(x\right)\mathrm{where}{f}_e\left(x\right)={\sum }_{i=1}^2{e}_i{f}_{e_i}\left(x\right)$.

(iii) 

$f_o\left(x\right)\in {\mathcal{R}}_2[x;{\theta }_t]$ such that ${\mathcal{C}}_o=\langle f_o\left(x\right)\rangle$ and $x^{n_3}-1=g_o\left(x\right)f_o\left(x\right)\mathrm{where}{f}_o\left(x\right)={\sum }_{i=1}^3{o}_i{f}_{o_i}\left(x\right)$.

Proof. 

Let $\mathcal{C}$ be a ${\theta }_t$-cyclic code of length $\gamma =n_1+n_2+n_3.$ From Theorem 6, we have that ${\mathcal{C}}_1,{\mathcal{C}}_e$, and ${\mathcal{C}}_o$ are ${\theta }_t$-cyclic codes. Using Lemma 1, $\left(i\right)$ follows.

Then, the proof of $\left(ii\right)$ is as follows. Let ${\mathcal{C}}_e=e_1{\mathcal{C}}_{e_1}\oplus e_2{\mathcal{C}}_{e_2}$ be a ${\theta }_t$-cyclic code of length $n_2$ over ${\mathcal{R}}_1.$ Thereom 7 says that, ${\mathcal{C}}_{e_1}$ and ${\mathcal{C}}_{e_2}$ are ${\theta }_t$-cyclic codes of length $n_2$ over ${\mathbb{F}}_q$. Lemma 1 says that we have ${\mathcal{C}}_i=\langle f_{e_i}\left(x\right)\rangle$ and $x^{n_2}-1=g_{e_i}\left(x\right)f_{e_i}\left(x\right)$ in ${\mathbb{F}}_q[x;{\theta }_t]$ for $i\in \{1,2\}$. Then, $e_i{f}_{e_i}\left(x\right)\in \mathcal{C}$ for $i\in \{1,2\}$. Also, for any $f_e\left(x\right)\in \mathcal{C}$, we have $f_e\left(x\right)={\sum }_{i=1}^2{e}_i{h}_{e_i}\left(x\right)f_{e_i}\left(x\right)$, where $h_{e_i}\left(x\right)\in {\mathbb{F}}_q[x;{\theta }_t]$ for $i\in \{1,2\}$. Thus, $f_e\left(x\right)\in \langle e_1{f}_{e_1}\left(x\right),e_2{f}_{e_2}\left(x\right)\rangle$. Therefore, $\mathcal{C}=\langle e_1{f}_{e_1}\left(x\right),e_2{f}_{e_2}\left(x\right)\rangle$. As $x^{n_2}-1=g_{e_i}\left(x\right)f_{e_i}\left(x\right)$ in ${\mathbb{F}}_q[x;{\theta }_t]$ for $i\in \{1,2\}.$ Let $f_e\left(x\right)=e_1{f}_{e_1}\left(x\right)+e_2{f}_{e_2}\left(x\right)\in {\mathcal{R}}_1[x;{\theta }_t]$. Then, $f_e\left(x\right)\in C$. On the other hand $e_i{f}_{e_i}\left(x\right)=e_i{f}_e\left(x\right)\in \langle f_e\left(x\right)\rangle$ for $i=1,2$. Consequently, $\mathcal{C}=\langle f_e\left(x\right)\rangle$. Furthermore, $\left[{\sum }_{i=1}^2{e}_i{g}_{e_i}\left(x\right)\right]f_e\left(x\right)={\sum }_{i=1}^2{e}_i{g}_{e_i}\left(x\right)f_{e_i}\left(x\right)={\sum }_{i=1}^2{e}_i(x^{n_2}-1)=x^{n_2}-1$. Then, $x^{n_2}-1=g_e\left(x\right)f_e\left(x\right)$ in ${\mathcal{R}}_1[x;{\theta }_t]$, where $g_e\left(x\right)={\sum }_{i=1}^2{e}_i{g}_{e_i}\left(x\right)$. Thus, $\left(ii\right)$ follows. $\left(iii\right)$ is similar to the proof of $\left(ii\right).$ □

5. Skew Constacyclic Code over $\mathcal{R}$

In this section, we study skew ${\theta }_t$-constacyclic codes over $\mathcal{R}$. We choose a unit element $\alpha \in {\mathcal{R}}_2^{*}\mathrm{such}\mathrm{that}\alpha$ satisfies the condition ${\alpha }^2=1,(\alpha =1,-1,\cdots ).$

Definition 3.

Let ${\alpha }_i\in {\mathbb{F}}_{p^t}\setminus \left\{0\right\}.$ A linear code $\mathcal{C}\subseteq {\mathcal{R}}_{\gamma }[x,\theta ]$ is called skew $\alpha ={\alpha }_1+u{\alpha }_2+v{\alpha }_3$-constacyclic code if it is invariant under the cyclic shift operator ${\lambda }_{\alpha }$, which is whenever:

$$\begin{array}{ccc}\hfill c& =& (x_0,x_1,\cdots ,x_{n_1-1},y_0,y_1,\cdots ,y_{n_2-1},z_0,z_1,\cdots ,z_{n_3-1})\in \mathcal{C}\hfill \\ \hfill {\lambda }_{\alpha }\left(c\right)& =& ({\alpha }_1{\theta }_t\left(x_{n_1-1}\right),{\theta }_t\left(x_0\right),\cdots ,{\theta }_t\left(x_{n_1}\right),({\alpha }_1+u{\alpha }_2){\theta }_t\left(y_{n_1-1}\right),{\theta }_t\left(y_1\right),\cdots ,{\theta }_t\left(y_{n_2-2}\right),\hfill \\ & & ({\alpha }_1+u{\alpha }_2+v{\alpha }_3){\theta }_t\left(z_{n_3-1}\right),{\theta }_t\left(z_0\right),\cdots ,{\theta }_t\left(z_{n_3-2}\right))\in \mathcal{C}\hfill \end{array}$$

The following two results translate symmetry conditions into algebraic constraints. We give the first result without proof.

Theorem 13.

Let $R_{n,\lambda }=R[x;{\theta }_t]/\langle x^n-\lambda \rangle$. A linear code C of length n over R is $({\theta }_t,\lambda )$-cyclic code if and only if C is a left $R[x;{\theta }_t]$-submodule of $R_{n,\lambda }$.

The second result is less immediate.

Theorem 14.

A code $\mathcal{C}$ is skew α-cyclic code over ${\mathcal{R}}_{\gamma }=\frac{{\mathbb{F}}_q[x,{\theta }_t]}{x^{n_1}-\alpha }\times \frac{{\mathcal{R}}_1[x,{\theta }_t]}{x^{n_2}-\alpha }\times \frac{{\mathcal{R}}_2[x,{\theta }_t]}{x^{n_3}-\alpha }$ iff $\mathcal{C}$ is a left ${\mathcal{R}}_2[x,{\theta }_t]$ module over ${\mathcal{R}}_{\gamma }.$

Proof. 

Let $\mathcal{C}$ be a skew $\alpha$-cyclic code. Then, by definition $x★\left(f\right(x\left)\right|g\left(x\right)\left|h\right(x\left)\right)\in \mathcal{C}$:

$$\begin{array}{c}\hfill x★\left(f\left(x\right)\right|g\left(x\right)\left|h\left(x\right)\right)=({\theta }_t\left(f_0\right)x+{\theta }_t\left(f_1\right)x^2+\cdots +{\alpha }_1{\theta }_t\left(f_{n_1-1}\right),{\theta }_t\left(g_0\right)x+{\theta }_t\left(g_1\right)x^2+\cdots +({\alpha }_1+u{\alpha }_2){\theta }_t\left(g_{n_2-1}\right),\\ \hfill {\theta }_t\left(h_0\right)x+{\theta }_t\left(h_1\right)x^2+\cdots +({\alpha }_1+u{\alpha }_2+v{\alpha }_3){\theta }_t\left(h_{n_3-1}\right))\in \mathcal{C}\end{array}$$

Moreover, by using linearity of $\mathcal{C}$:

$$r\left(x\right)★\left(g_1\left(x\right)\right|g_2\left(x\right)\left|g_3\left(x\right)\right)\in \mathcal{C}$$

for some $r\left(x\right)\in {\mathcal{R}}_2[x,{\theta }_t].$ Hence, $\mathcal{C}$ is an left ${\mathcal{R}}_2[x,{\theta }_t]$ submodule over ${\mathcal{R}}_{\gamma }.$ Conversely, assume that $\mathcal{C}$ is an left ${\mathcal{R}}_2[x,{\theta }_t]$ submodule over ${\mathcal{R}}_{\gamma },$ then we have $x★\left(f\right(x\left)\right|g\left(x\right)\left|h\right(x\left)\right)\in \mathcal{C}$ implies $\mathcal{C}$ is skew $\alpha$-cyclic code. □

Theorem 15.

The code ${\mathcal{C}}_o\subseteq {\mathcal{R}}_2^n$ is skew $\alpha ={\alpha }_1+u{\alpha }_2+v{\alpha }_3$-cyclic of length n iff ${\mathcal{C}}_{o_1},{\mathcal{C}}_{o_2}$, and ${\mathcal{C}}_{o_3}$ are skew ${\alpha }_1,{\alpha }_1+{\alpha }_2,{\alpha }_1+{\alpha }_3$-cyclic codes over ${\mathbb{F}}_q$ of length $n.$

Proof. 

Let ${\mathcal{C}}_o$ be a skew $\alpha$-cyclic code. Let $a=x{o}_1+y{o}_2+z{o}_3\in {\mathcal{C}}_o$, where $x=(x_0,x_1,\cdots ,x_{n-1})\in {\mathcal{C}}_{o_1},y=(y_0,y_1,\cdots ,y_{n-1})\in {\mathcal{C}}_{o_2}$ and $x=(z_0,z_1,\cdots ,z_{n-1})\in {\mathcal{C}}_{o_3}.$ Then, we have by definiton, ${\lambda }_{\alpha }\left(x\right)\in {\mathcal{C}}_o,$:

$$\begin{array}{ccc}\hfill {\lambda }_{\alpha }(o_1(x_0,x_1,\cdots ,x_{n-1})+o_2(y_0,y_1,\cdots +y_{n-1})& & \\ \hfill +o_3(z_0,z_1,\cdots ,z_{n-1}))& =& (({\alpha }_1+u{\alpha }_2+v{\alpha }_3)★o_1({\theta }_t\left(x_{n-1}\right),{\theta }_t\left(x_0\right),\cdots ,{\theta }_t\left(x_{n-2}\right))+\hfill \\ & & ({\alpha }_1+u{\alpha }_2+v{\alpha }_3)★o_2({\theta }_t\left(y_{n-1}\right),{\theta }_t\left(y_0\right),\cdots +{\theta }_t\left(y_{n-2}\right))+\hfill \\ & & ({\alpha }_1+u{\alpha }_2+v{\alpha }_3)★o_3({\theta }_t\left(z_{n-1}\right),{\theta }_t\left(z_0\right),\cdots ,{\theta }_t\left(z_{n-1}\right)))\hfill \\ & \Rightarrow & {\lambda }_{{\alpha }_1}\left(x\right)+{\lambda }_{{\alpha }_1+{\alpha }_2}\left(y\right)+{\lambda }_{{\alpha }_1+{\alpha }_3}\left(z\right)\in {\mathcal{C}}_o\hfill \\ & \Rightarrow & {\lambda }_{{\alpha }_1}\left(x\right)\in {\mathcal{C}}_{o_1},{\lambda }_{{\alpha }_1+{\alpha }_2}\left(y\right)\in {\mathcal{C}}_{o_2},{\lambda }_{{\alpha }_1+{\alpha }_3}\left(z\right)\in {\mathcal{C}}_{o_3}\hfill \end{array}$$

Hence, ${\mathcal{C}}_{o_1},{\mathcal{C}}_{o_2},\mathrm{and}{\mathcal{C}}_{o_3}$ are skew ${\alpha }_1,{\alpha }_1+{\alpha }_2,{\alpha }_1+{\alpha }_3$-cyclic codes over ${\mathbb{F}}_q$ of length $n.$

Conversely, assume that ${\mathcal{C}}_{o_1},{\mathcal{C}}_{o_2}\mathrm{and}{\mathcal{C}}_{o_3}$ are skew ${\alpha }_1,{\alpha }_1+{\alpha }_2,{\alpha }_1+{\alpha }_3$-cyclic codes over ${\mathbb{F}}_q$ of length $n.$ Let $m_0,m_1,\cdots ,m_{n-1}$ be an element in ${\mathcal{C}}_o,$ where $m_i=o_1{x}_i+o_2{y}_i+o_3{z}_i$ such that $x=(x_0,x_2,\cdots ,x_{n-1})\in {\mathcal{C}}_{o_1},y=(y_0,y_2,\cdots ,y_{n-1})\in {\mathcal{C}}_{o_2}$ and $z=(z_0,z_2,\cdots ,z_{n-1})\in {\mathcal{C}}_{o_3}.$ Then we have ${\lambda }_{{\alpha }_1}\left(x\right)\in {\mathcal{C}}_{o_1},{\lambda }_{{\alpha }_1+{\alpha }_2}\left(y\right)\in {\mathcal{C}}_{o_2}\mathrm{and}{\lambda }_{{\alpha }_1+{\alpha }_3}\left(z\right)\in {\mathcal{C}}_{o_3}.$ So we get,

$$\begin{array}{ccc}\hfill o_1{\lambda }_{{\alpha }_1}\left(x\right)+o_2{\lambda }_{{\alpha }_1+{\alpha }_2}\left(y\right)+o_3{\lambda }_{{\alpha }_1+{\alpha }_3}\left(z\right)& =& o_1{\lambda }_{{\alpha }_1}(x_0,x_1,\cdots ,x_{n-1})+o_2{\lambda }_{{\alpha }_1+{\alpha }_2}(y_0,y_1,\cdots +y_{n-1})\hfill \\ & & +o_3{\lambda }_{{\alpha }_1+{\alpha }_3}(z_0,z_1,\cdots ,z_{n-1})\in \mathcal{C}\hfill \\ & =& {\lambda }_{\alpha }(m_0,m_1,\cdots ,m_{n-1})\in \mathcal{C}\hfill \end{array}$$

Hence, $\mathcal{C}$ is skew $\alpha -$cyclic code over ${\mathcal{R}}_2^n.$ □

Theorem 16.

${\mathcal{C}}_e$ be a a skew $\alpha ={\alpha }_1+u{\alpha }_2$-cyclic code over ${\mathcal{R}}_1$ iff ${\mathcal{C}}_{e_1}$ and ${\mathcal{C}}_{e_2}$ are skew ${\alpha }_1+{\alpha }_2$ and ${\alpha }_1$-cyclic codes over ${\mathbb{F}}_q.$

Proof. 

The proof is similar to Theorem 15 taking mod v to the above condition. □

Theorem 17.

$\mathcal{C}$ be a skew $\alpha ={\alpha }_1+u{\alpha }_2+v{\alpha }_3$-cyclic code over $\mathcal{R}$ of length $\gamma =n_1+n_2+n_3$ iff ${\mathcal{C}}_1,{\mathcal{C}}_e\mathrm{and}{\mathcal{C}}_o$ are ${\alpha }_1,{\alpha }_1+u{\alpha }_2$, and ${\alpha }_1+u{\alpha }_2+v{\alpha }_3$-cyclic codes over ${\mathbb{F}}_q,{\mathcal{R}}_1\mathrm{and}{\mathcal{R}}_2$, respectively.

Proof. 

${\mathcal{C}}_1,{\mathcal{C}}_e\mathrm{and}{\mathcal{C}}_o$ be ${\alpha }_1,{\alpha }_1+u{\alpha }_2$, and ${\alpha }_1+u{\alpha }_2+v{\alpha }_3$-cyclic. Consider $x=(x_0,x_1,\cdots ,x_{n_1-1}),$ $y=(y_0,y_1,\cdots ,y_{n_2-1})$ and $z=(z_0,z_1,\cdots ,z_{n_3-1}).$ Consider ${\alpha }_1+u{\alpha }_2=\beta .$ Then, we have:

$$(x,y,z)\in \mathcal{C}\Rightarrow ({\lambda }_{{\alpha }_1}\left(x\right),{\lambda }_{\beta }\left(y\right),{\lambda }_{\alpha }\left(y\right))\in \mathcal{C}$$

Hence, $\mathcal{C}$ is skew $\alpha$-cyclic. The converse part holds similarly. □

Theorem 18.

$\mathcal{C}$ be a skew α-cyclic code of length $\gamma =n_1+n_2+n_3$ iff ${\mathcal{C}}_1$ is skew ${\alpha }_1$-cyclic code of length $n_1$, ${\mathcal{C}}_{e_1}$, and ${\mathcal{C}}_{e_2}$ are ${\alpha }_1+{\alpha }_2,{\alpha }_1$-cyclic codes of length $n_2$ and ${\mathcal{C}}_{o_1},{\mathcal{C}}_{o_2}$, and ${\mathcal{C}}_{o_3}$ are skew ${\alpha }_1,{\alpha }_1+{\alpha }_2,{\alpha }_1+{\alpha }_3$-cyclic codes over ${\mathbb{F}}_q$ of length $n_3.$

Proof. 

Using Theorems 15–17 the result follows. □

Theorem 19.

$\mathcal{C}$ be a skew $\alpha ={\alpha }_1+u{\alpha }_2+v{\alpha }_3$-cyclic code over $\mathcal{R}$ of length $\gamma =n_1+n_2+n_3$ iff ${\mathcal{C}}_1^{\perp },{\mathcal{C}}_e^{\perp },\mathrm{and}{\mathcal{C}}_o^{\perp }$ are ${\left({\alpha }_1\right)}^{-1},{({\alpha }_1+u{\alpha }_2)}^{-1}$, and ${({\alpha }_1+u{\alpha }_2+v{\alpha }_3)}^{-1}$-cyclic.

Proof. 

Let $\mathcal{C}$ be a skew $\alpha$-cyclic code, Lemma 3.1 [5] says that ${\mathcal{C}}^{\perp }$ is skew ${({\alpha }_1+u{\alpha }_2+v{\alpha }_3)}^{-1}$-cyclic code. From Theorem 17, we have ${\mathcal{C}}_1^{\perp },{\mathcal{C}}_e^{\perp }\mathrm{and}{\mathcal{C}}_o^{\perp }$ are skew ${\left({\alpha }_1\right)}^{-1},{({\alpha }_1+u{\alpha }_2)}^{-1}$ and ${({\alpha }_1+u{\alpha }_2+v{\alpha }_3)}^{-1}$-cyclic. □

Corollary 2.

Let $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o.$ be a skew $\alpha ={\alpha }_1+u{\alpha }_2+v{\alpha }_3$-cyclic code over $\mathcal{R}$ of length $\gamma =n_1+n_2+n_3$. Then, there exist polynomials:

(i)

$f_1\left(x\right)\in {\mathbb{F}}_q[x;{\theta }_t]$ such that ${\mathcal{C}}_1=\langle f_1\left(x\right)\rangle$ and $x^{n_1}-{\alpha }_1=g_1\left(x\right)f_1\left(x\right)$.

(ii)

$f_e\left(x\right)\in {\mathcal{R}}_1[x;{\theta }_t]$ such that ${\mathcal{C}}_e=\langle f_e\left(x\right)\rangle$ and $x^{n_2}-({\alpha }_1+u{\alpha }_2)=g_e\left(x\right)f_e\left(x\right)$.

(iii)

$f_o\left(x\right)\in {\mathcal{R}}_2[x;{\theta }_t]$ such that ${\mathcal{C}}_o=\langle f_o\left(x\right)\rangle$ and $x^{n_3}-({\alpha }_1+u{\alpha }_2+v{\alpha }_3)=g_o\left(x\right)f_o\left(x\right)$.

Proof. 

The proof is similar to the proof of Theorem 12. □

Theorem 20.

Let $\mathcal{C}={\mathcal{C}}_1\otimes {\mathcal{C}}_e\otimes {\mathcal{C}}_o$ be a ${\theta }_t$-constacyclic code of length γ over $\mathcal{R}$. Then $\mathcal{C}=\langle {\mathcal{B}}_1,{\mathcal{B}}_2,{\mathcal{B}}_o\rangle$, where ${\mathcal{B}}_1=\langle (f_1\left(x\right),0,0)\rangle ,B_1=\langle (0,f_e\left(x\right),0)\rangle ,$ and $B_1=\langle (b_1\left(x\right),b_e\left(x\right),f_o\left(x\right))\rangle$.

Proof. 

The proof is similar to the proof of Theorem 11. □

Example 1.

Let $q=9$ and ${\mathbb{F}}_9={\mathbb{F}}_3\left[z\right]$ with $z^2+1=0.$ Consider the ring $R_{\gamma }=\frac{{\mathbb{F}}_9[x,{\theta }_3]}{x^4-1}\times \frac{{\mathcal{R}}_1[x,{\theta }_3]}{x^5-1}\times \frac{{\mathcal{R}}_2[x,{\theta }_3]}{x^5-1}$, where ${\theta }_3$ is the Frobenius automorphism defined by ${\theta }_3\left(a\right)=a^3$ for any $a\in {\mathbb{F}}_9.$ Write:

$x^4-1=(x+1)(x+2)(x+z)(x+2z)\in {\mathbb{F}}_9[x,{\theta }_3]$

$x^5-1=(x+2)(x^4+x^3+x^2+x+1)\in {\mathbb{F}}_9[x,{\theta }_3]$

$f_1\left(x\right)=\langle (x+1)\rangle ,f_e\left(x\right)=\langle e_1(x+2)+e_2(x+2)\rangle ,f_o\left(x\right)=\langle o_1(x+2)+o_2(x+2)+o_3(x+2)\rangle$ By Theorem 12, we have that $f_i$ divides $x^{n_i}-1$ for $(i=1,e,o)$, yielding a code with parameter $[29,18,2]$ over ${\mathbb{F}}_9.$

Example 2.

Let $q=25$ and ${\mathbb{F}}_{25}={\mathbb{F}}_5\left[z\right]$ with $z^2+z+1=0.$ Consider the ring $R_{\gamma }=\frac{{\mathbb{F}}_{25}[x,{\theta }_5]}{x^4-1}\times \frac{{\mathcal{R}}_1[x,{\theta }_5]}{x^6-1}\times \frac{{\mathcal{R}}_2[x,{\theta }_5]}{x^4-1}$, where ${\theta }_5$ is the Frobenius automorphism defined by ${\theta }_5\left(a\right)=a^5$ for any $a\in {\mathbb{F}}_{25}.$ Write

$x^4-1=(x+2)(x+3)(x+z)(x+z+1)\in {\mathbb{F}}_{25}[x,{\theta }_5]$

$x^6-1=(x^2-1)(x^2+x+1)(x^2-x+1)\in {\mathbb{F}}_{25}[x,{\theta }_5]$

$f_1\left(x\right)=\langle (x+2)\rangle ,f_e\left(x\right)=\langle e_1(x^2-1)+e_2(x^2-1)\rangle ,f_o\left(x\right)=\langle o_1(x+z+1)+o_2(x+z+1)+o_3(x+z+1)\rangle$ By Theorem 12, we have that $f_i$ divides $x^{n_i}-1$ for $(i=1,e,o)$ yielding a code with parameter $[28,20,2]$ over ${\mathbb{F}}_{25}.$

6. Conclusions and Open Problems

In this note, we have studied the algebraic and metric structure of skew cyclic and skew constacyclic codes over a special mixed alphabet. Thus, our codes have a structure of module over the largest of the three alphabets ${\mathcal{R}}_2.$ Codes over the product ring ${\mathbb{F}}_q\times {\mathcal{R}}_1\times {\mathcal{R}}_2$ would be modules over that larger ring. The two algebraic structures are different and should not be confused.

The present work leads itself to two paths of generalization: consider different mixed alphabets or replace the concepts of cyclicity by that of quasi-cyclicity. The former path seems easier than the latter, in view of the many examples of rings that have been used as alphabets of cyclic codes in recent years. On the other hand, the structure of quasi-cyclic codes is always more subtle than that of cyclic codes.