Results on spirallike p-valent functions

1.   Introduction

Within the coding theory, linear codes and cyclic codes, which have been studied for years on different rings, have a strong algebraic structure. Therefore, a wide range of methods and approaches have been studied in ^[1,2,3,4,5]. Constacyclic codes, which are an extension of these important codes, were introduced by Eugene Prange for the first time ^[6], and recently new $ \mathbb{Z}_{4} $-codes were found by using these code families. Dinh et al. and Gao et al. have worked over the ring $ \mathbb{Z}_{4}+v\mathbb{Z}_{4} $ when $ v^2 = v $. Dinh et al. ^[7] has illustrated an original Gray map over this ring and has studied cyclic, constacyclic for the units $ 1+2v $ and $ 3+2v $, negacyclic, and the self dual of $ \theta $-constacyclic codes. They have described a generator polynomial for cyclic and constacyclic codes of odd length. They have given multiple samples and obtained new $ \mathbb{Z}_{4} $ codes. Gao et al. ^[8] evaluated the linear codes that were placed on this ring and researched the Euclidean self dual codes. They have drawn attention to Hermitian dual codes and discussed the connection to unimodular complex lattice points. By analyzing the cyclic codes over the ring, they have created generator polynomials. Ultimately, based on the quadratic codes, they have achieved good and new $ \mathbb{Z}_{4} $-linear codes.

In addition to the studies in commutative structures, the studies on noncommutative structures gained a rapid acceleration in a short period of time and took its place in the world of literature. The definition of a special multiplication is the most important feature that separates the noncommutative structure from the commutative structure. This structure called skew has been studied mainly over $ {\mathbb{F}_{q}} $ ^[9,10]. Skew cyclic codes, one of the generalizations of cyclic codes and first introduced by Boucher, have attracted the attention of many researchers as they are more advantageous for finding optimal codes. Then, in addition to skew cyclic codes, other families of codes were also researched by many researchers. The articles ^{[10,11,12,13,14]} are some examples of skew articles. Gursoy et al. ^[10], using the decomposition, researched the structural features of the skew cyclic codes over $ \mathbb{F}_{q} $ where $ v^2 = v $ and created generator polynomials for these codes. They also mentioned idempotent generators and BCH (Bose-Chaudhuri-Hocquenghem) type bounds. Sharma et al. ^[14] defined a new automorphism over the ring $ \mathbb{Z}_{4}+u\mathbb{Z}_{4} $ when $ u^2 = 0 $ and investigated the characteristic structure of skew constacyclic codes. They also mentioned double constacyclic codes and found good codes over $ \mathbb{Z}_{4} $.

Adleman, who successfully solved the NP-hard problem (non-deterministic polynomial-time problem. For example, travelling salesman problem.) using DNA molecules, proposed the first computation on the structure of DNA ^[15]. For many years now, the structure of the DNA cyclic codes has been studied by many researchers and a large number of articles have been written about it. Notable contributions in this field include the works of ^{[16,17,18,19,20]}. In addition to these, you can also find several important articles in more detail here: In ^[21], an analysis of skew-constacyclic codes over the ring $ ^{\mathbb{F}_4[v]}/_{\langle v^2-v\rangle} $ was performed by Bayram et al. They also searched for reversible codes and obtained DNA codes using Griesmer bound. Dinh et al. ^[22] studied the reversible codes and the reversible-complement codes over the ring $ \mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2+v^2\mathbb{F}_2+uv^2\mathbb{F}_2 $, where $ u^2 = 0 $ and $ v^3 = v $, and explored the binary image of the cyclic DNA codes over this ring. In ^[23], the authors searched for cyclic DNA codes with the help of $ ^{\mathbb{F}_2[u]}/_{\langle u^2-1\rangle} $ and studied the CG-content (The CG-content (or GC-content) of DNA codes refers to the percentage of nucleotides in a DNA molecule that are either cytosine (C) or guanine (G).) of these codes. In ^[24], Yildiz and Siap investigated the algebraic structure of cyclic DNA codes of odd length. They did so by associating the elements of the ring with the DNA pairs. In ^[25], the authors studied DNA codes of odd length over the ring $ \mathbb{Z}_4+v\mathbb{Z}_4 $ with $ v^2 = v $. They also characterized cyclic codes of odd length and presented a new method of constructing DNA codes. Hence, they found some DNA codes with 256 code words.

Our specific focus in this article is on cyclic, $ \theta_i $-cyclic, $ (\theta_i, \lambda) $-constacyclic, and DNA codes over $ \mathbb{Z}_{4}+u\mathbb{Z}_{4}+u^{2}\mathbb{Z}_{4} $ with $ u^3 = u^2 $. Throughout this paper, we will represent the $ 64 $-element commutative ring $ \mathbb{Z}_{4}+u\mathbb{Z}_{4}+u^{2}\mathbb{Z}_{4} $ with $ u^3 = u^2 $ via $ T_3 $ and also search the structure of $ T_3 $ for odd length $ \varpi $. This paper is divided into the following sections: In Section 2, we deal with the basic concepts of the ring $ T_3 $. In Section 3, we give the most important descriptions of the skew codes and determine all the automorphisms of $ T_3 $. In the following, we define the generator polynomials for skew cyclic codes and skew $ \lambda $-constacyclic codes over this ring. Finally, we concentrate on the $ \mathbb{Z}_{4} $-images of skew $ \lambda $-constacyclic codes for each defined automorphisms. For all units over this ring, there are cyclic codes or quasi-cyclic codes of index $ 2 $ over $ \mathbb{Z}_{4} $. We present a number of new and optimal codes as a result of this observation and we present them in tables. In Section 4, we relate the components of the $ T_3 $ ring to the DNA 2-mers through the new transformation identified, with the $ \phi_1 $ Gray map. Furthermore, we have created a new generation method for generating a reversible code over the ring $ T_3 $ by defining a unit reverse polynomial. In addition, we have also provided examples of how to strengthen the operation of this method.

2.   Preliminary informations for the ring $ T_3 $

$ T_3 $ is isomorphic to the quotient ring $ ^{\mathbb{Z}_{4}[u]}/_{\langle u^3-u^2\rangle } $ and is a non-chain ring. Moreover, this ring is a nonlocal ring because it does not have a single maximal ideal. As well, the set of units of $ T_3 $ are $ \{1, 3$, $1+2u$, $3+2u$, $1+u+u^2$, $3+u+u^2$, $1+3u+u^2$, $3+3u+u^2$, $1+2u^2$, $3+2u^2$, $1+2u+2u^2$, $3+2u+2u^2$, $1+u+3u^2$, $3+u+3u^2$, $1+3u+3u^2$, $3+3u+3u^2\} $. The ring is a Frobenius ring because, through the instrument of the Chinese remainder theorem (CRT), it can be stated as a direct sum of the local rings with a single minimal ideal. Nonlocal Frobenius rings are expressed as the direct sum of local rings with the help of the CRT.

Let $ \mathfrak{y} $ be any element of $ T_3 $ demonstrated as $ \mathfrak{y} = a_0+ua_1+u^2a_2 $ for $ a_0, a_1, a_2\in\mathbb{Z}_4 $. A code of length $ \varpi $ over $ T_3 $ is a subset of $ T_3^\varpi $. $ \mathfrak{C_3} $ is a linear if, and only if, $ \mathfrak{C_3} $ is a sub-module of $ T_3 $. The elements of the linear code are called code words.

Each code word $ \mathfrak{y} = (\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1}) $ is qualified via its polynomial form $ \mathfrak{y}(x) = \mathfrak{y}_0+\mathfrak{y}_1x+\dots+\mathfrak{y}_{\varpi-1}x^{\varpi-1} $ for each $ \mathfrak{y}_i = a_0^i+ua_1^i+u^2a_2^i $ with $ i = 0, 1, \dots, \varpi-1 $.

Using these explanations, we can define the cyclic code and $ \lambda $-constacyclic code definitions needed in this study as follows:

(ⅰ) Let $ \rho_{\lambda} $ be a $ \lambda $-constacyclic shift operator. A linear code $ \mathfrak{C_3} $ is said to be $ \lambda $-constacyclic code of length $ \varpi $ over $ T_3 $ if $ \rho_{\lambda}(\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1}) = (\lambda \mathfrak{y}_{\varpi-1}, \mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-2})\in \mathfrak{C_3} $ while $ (\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1})\in \mathfrak{C_3} $. In other words, $ \mathfrak{C_3} $ is a $ \lambda $-constacyclic code over $ T_3 $ if, and only if, $ \mathfrak{C_3} $ is an ideal of $ ^{T_3[x]}/_{\langle x^\varpi-\lambda\rangle} $.

(ⅱ) In the above definition, if $ 1 $ is written instead of $ \lambda $, this code is called a cyclic code. In other words, $ \sigma(\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1}) = (\mathfrak{y}_{\varpi-1}, \mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-2}) $ is an element in $ \mathfrak{C_3} $ where $ (\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1})\in \mathfrak{C_3} $ such that $ \sigma $ is a cyclic shift operator.

Nonlocal rings can be represented by local rings, which have an important position in coding theory with the help of CRT. For detailed information, see ^[26,27]. From this point of view, motivated by our work in ^[1], we obtain the decomposition of $ T_3 $. Recall that the ring $ \mathbb{Z}_{4}+u\mathbb{Z}_{4} $ works with $ u^2 = 0 $.

Moreover, the linear code $ \Re $ over $ \mathbb{Z}_{4} $ with length $ \varpi $ is defined as $ \Re = \{z+c+t\in\mathbb{Z}_{4}^{m}, \:\: z+uc+u^{2}t \in\mathfrak{C_3}\} $ and the linear code $ \Im $ over $ \mathbb{Z}_{4}+u\mathbb{Z}_{4} $ with length $ \varpi $ is defined as $ \Im = \{z+uc\in (\mathbb{Z}_{4}+u{\mathbb{Z}_{4}})^{\varpi}, \:\: z+uc+{u}^{2}t \in\mathfrak{C_3} $ for some $ t\in \mathbb{Z}_{4}^{\varpi}\} $. Based on this, the linear code $ \mathfrak{C_3} $ of odd length $ \varpi $ over $ T_{3} $ can be uniquely shown as $ \mathfrak{C_3} = u^{2}\Re\oplus(1+3u^{2})\Im $.

Consider the same three Gray maps in ^[1] for $ \theta_i $-cyclic codes over $ T_3 $. Recall these maps, which are linear and preserve the Euclidean, Lee, and Hamming distances from $ T_3 $ to $ \mathbb{Z}_{4}^{2\varpi} $:

Identifying the elements $ \phi_i(\mathfrak{y}(x)) = \mathfrak{y} = (\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1}) $ in $ T_3^\varpi $ with polynomials $ \mathfrak{y}(x) = \mathfrak{y}_0+\mathfrak{y}_1x+\dots+\mathfrak{y}_{\varpi-1}x^{\varpi-1} $ for each $ \mathfrak{y}_i = a_0^i+ua_1^i+u^2a_2^i $ with $ i = 0, 1, \dots, \varpi-1 $, we get

Based on the information presented, we will now examine the skew cyclic, skew constacyclic and DNA codes over $ T_3 $. By constructing generator polynomials, our aim is to acquire new and optimal codes via the Gray maps that have been defined earlier. Furthermore, we are attempting a unique perspective by constructing a new polynomial that is exclusive to DNA codes over the ring. This polynomial will be enriched with examples to serve our purpose.

3.   $ \theta_i $-cyclic and $ (\theta_i, \lambda) $-constacylic codes over $ T_3 $

In this section, skew cyclic and skew constacyclic codes over $ T_3 $ are analyzed. To begin, all nontrivial automorphisms of $ T_3 $ are identified. These maps $ \theta_i $ on $ T_3 $ for $ i = 1, 2, 3 $ are defined such that

from $ T_3 $ to $ T_3 $. This ring $ T_3[x, \theta_i] = \{a_o+a_1x+\dots+a_{\varpi-1}x^{\varpi-1}:\: a_i\in T_3, \:\: i = 0, 1, \dots, \varpi-1, \: \varpi\in\mathbb{N}\} $ is called a skew polynomial ring. Note that this ring is a noncommutative ring. Herewith the multiplication is described using the precise normal size which is well-known to be $ (fx^r)(yx^k) = f\theta_i^r(y)x^{r+k} $ while the addition in this ring is the usual polynomial addition. The order of all defined automorphisms $ \theta_i $ is $ 2 $.

An element $ d(x)\in T_3[x, \theta_i] $ is said to be a right divisor of $ l(x) $ if there exists $ q(x)\in T_3[x, \theta_i] $ such that $ l(x) = q(x)d(x) $. Thus, $ l(x) $ is called a left multiple of $ d(x) $, and a left divisor of $ l(x) $ can be defined similarly. In this paper, division stands for right division, and if $ l(x)\in T_3[x, \theta_i] $, then we put to use the notation $ \langle l(x)\rangle $ for the left ideal generated by $ l(x) $.

Throughout this section, the quotient ring $ ^{T_3[x, \theta_i]}/_{\langle x^\varpi-1\rangle} $ will be represented by $ T_{3, \varpi_{\theta_i}} $ and $ ^{T_3[x, \theta_i]}/_{\langle x^\varpi-\lambda\rangle} $ will be represented by $ T_{3, \varpi_{\theta_i, \lambda}} $. These quotient rings are left-$ T_3[x, \theta_i] $ module with the multiplication identified by $ d(x)(l(x)+\langle x^\varpi-1\rangle) = d(x)l(x)+\langle x^\varpi-1\rangle $ and $ d(x)(l(x)+\langle x^\varpi-\lambda\rangle) = d(x)l(x)+\langle x^\varpi-\lambda\rangle $ for any $ d(x), l(x)\in T_3[x, \theta_i] $. We characterize a $ T_3 $-module isomorphism from $ T_3^\varpi $ to $ T_{3, \varpi_{\theta_i}} $ such that $ (\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1})\to \mathfrak{y}_0+\mathfrak{y}_1x+ \dots+ \mathfrak{y}_{\varpi-1}x^{\varpi-1} $.

The fundamental definition and theorems that underlie the structure of the skew codes are outlined below.

Definition 1. A skew linear code $ \mathfrak{C_3} $ of odd length $ \varpi $ over the ring $ T_3 $ is a left $ T_3[x, \theta_i] $-sub-module of the left module $ ^{T_3[x, \theta_i]}/_{\langle l(x)\rangle} $, where $ l(x) $ is a polynomial of degree $ \varpi $ over $ T_3[x, \theta_i] $.

Theorem 1. $ T_{3, \varpi_{\theta_i}} $ is a $ T_3[x, \theta_i] $-left module where multiplication is defined as above.

Theorem 2. A code $ \mathfrak{C_3} $ of length $ \varpi $ in $ T_{3, \varpi_{\theta_i}} $ is a $ \theta_{i} $-cyclic code if, and only if, $ \mathfrak{C_3} $ is a left $ T_3[x, \theta_i] $-sub-module of the left $ T_3[x, \theta_i] $-module $ T_{3, \varpi_{\theta_i}} $.

Theorem 3. A code $ \mathfrak{C_3} $ of length $ \varpi $ in $ T_{3, \varpi_{\theta_i}} $ is a $ (\theta_{i}, \lambda) $-constacyclic code if, and only if, $ \mathfrak{C_3} $ is a left $ T_{3, \varpi_{\theta_i, \lambda}} $-sub-module of the left $ T_3[x, \theta_i] $-module over $ T_{3, \varpi_{\theta_i, \lambda}} $.

Note that throughout this paper we represent skew cyclic codes by $ \theta_i $-cyclic codes and skew $ \lambda $-constacyclic codes by $ (\theta_i, \lambda) $-constacyclic codes. So, if $ {T_{3}}_{{\theta_i, \lambda}}(\mathfrak{C_3}) = \mathfrak{C_3} $ then a $ T_3 $-sub-module of $ T_3^\varpi $ is a $ (\theta_i, \lambda) $-constacyclic code. In particular, if $ \lambda = 1 $, then $ \mathfrak{C_3} $ is said to be a $ \theta_i $-cyclic code.

Definition 2. A subset $ \mathfrak{C_3} $ of $ T_3 $ is called a $ (\theta_i, \lambda) $-constacyclic code of length $ \varpi $ over $ T_3 $ if $ \mathfrak{C_3} $ is a $ T_3 $-sub-module of $ T_3^\varpi $, and for any $ (\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1})\in \mathfrak{C_3} $, we have $ (\lambda \theta_i(\mathfrak{y}_{\varpi-1}), \theta_i(\mathfrak{y}_0), \dots, \theta_i(\mathfrak{y}_{\varpi-2}))\in\mathfrak{C_3} $. It should not be forgotten that if $ \lambda $ is chosen as $ 1 $, then the $ (\theta_i, \lambda) $-constacyclic code of length $ \varpi $ over $ T_3 $ is a $ \theta_i $-cyclic code of length $ \varpi $ over $ T_3 $.

With the help of all these descriptions, let's construct the generator polynomial for $ \theta_i $-cyclic and $ (\theta_i, \lambda) $-constacyclic codes over $ T_3 $.

Theorem 4. Let $ \mathfrak{C_3} $ be a linear code over $ T_3 $ of length $ \varpi $ and $ \mathfrak{C_3} = u^2\Re\oplus(1+3u^2)\Im $ be its decomposition, where $ \Re $ is a code of length $ \varpi $ over $ \mathbb{Z}_{4} $ and $ \Im $ is a code of length $ \varpi $ over $ \mathbb{Z}_{4}+u\mathbb{Z}_{4} $ where $ u^2 = 0 $. Then, $ \mathfrak{C_3} $ is a $ \theta_i $-cyclic code as regards to the automorphism $ \theta_i $ if, and only if, $ \Re $ and $ \Im $ are both $ \theta_i $-cyclic codes over $ \mathbb{Z}_{4} $ and $ \mathbb{Z}_{4}+u\mathbb{Z}_{4} $, respectively, as regards to the automorphism $ \theta_i $.

Proof. For $ i = 0, 1, \dots, \varpi-1 $, let $ \mathfrak{y} = (\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1})\in \mathfrak{C_3} $ and $ \mathfrak{y}_i = u^2p_i+(1+3u^2)v_i $. Assume that $ p = (p_0, \dots, p_{\varpi-1})\in \Re $ and $ v = (v_0, \dots, v_{\varpi-1})\in \Im $ such that $ v_i = a_i+ub_i $ where $ i = 0, 1, \dots, \varpi-1 $. Due to $ \mathfrak{C_3} $ being $ \theta_i $-cyclic if $ (u^2p_{0}\oplus (1+3u^2)v_{0}, \dots, u^2p_{\varpi-1}\oplus (1+3u^2)v_{\varpi-1})\in \mathfrak{C_3} $, then $ (\theta_i(u^2p_{\varpi-1}\oplus (1+3u^2)v_{\varpi-1}), \theta_i(u^2p_{0}\oplus (1+3u^2)v_{0}), \dots, \theta_i(u^2p_{\varpi-2}\oplus (1+3u^2)v_{\varpi-2}))\in \mathfrak{C_3} $. Herefrom, $ u^2\sigma_{\theta_i}p\oplus (1+3u^2)\sigma_{\theta_i}v\in \mathfrak{C_3} $. Because of $ \sigma_{\theta_i}(u^2p\oplus(1+3u^2)v) = u^2\sigma_{\theta_i}p\oplus(1+3u^2)\sigma_{\theta_i}v $, then $ \Re $ and $ \Im $ are $ \theta_i $-cyclic. Conversely, if $ \Re $ and $ \Im $ is $ \theta_i $-cyclic, $ \sigma_{\theta_i}p\in\Re $ while $ p\in\Re $ and $ \sigma_{\theta_i}v\in\Re $ while $ v\in\Im $. So $ u^2\sigma_{\theta_i}p\oplus(1+3u^2)\sigma_{\theta_i}v\in \mathfrak{C_3} $. Hence, $ \mathfrak{C_3} $ is $ \theta_i $-cyclic. □

Let us compose the generator polynomial of the $ \theta_i $-cyclic code with the assistance of this theorem.

Theorem 5. Let $ \mathfrak{C_3} = u^2\Re\oplus(1+3u^2)\Im $ be a $ \theta_i $-cyclic code of length $ \varpi $ over $ T_3 $. In this case, $ \Re $ is a cyclic code over $ \mathbb{Z}_{4} $ and $ \Im $ is a cyclic code over $ \mathbb{Z}_{4}+u\mathbb{Z}_{4} $ such that $ \mathfrak{C_3} = (u^2\langle \mathfrak{f_1}(x)(\mathfrak{t_1}(x)+2)\rangle)\oplus((1+3u^2)\langle \mathfrak{f_2}(x)(\mathfrak{t_2}(x)+2)+u\mathfrak{f_{1, 2}}(x)(\mathfrak{t_{1, 2}}(x)+2), \: u\mathfrak{f_3}(x)(\mathfrak{t_3}(x)+2)\rangle) $ where $ {{x^\varpi}-1} = \mathfrak{f_i}(x)\mathfrak{t_i}(x)\mathfrak{d_i}(x) $ for $ i = 1, 2, 3 $.

Proof. The proof can easily be done following the methodology outlined in our previous publication ^[1]. □

Theorem 6. Let $ \mathfrak{C_3} = u^2\Re\oplus(1+3u^2)\Im $ be a $ \theta_i $-cyclic code of length $ \varpi $ over $ T_3 $. Given that the generator polynomial of $ \Re $ is $ \langle \tau_1(x) \rangle $ and the generator polynomial of $ \Im $ is $ \langle \tau_2(x), \tau_3(x) \rangle $, then $ \mathfrak{C_3} = \langle u^{2}\tau_1(x), \: (1+3u^{2})\langle \tau_2(x), \tau_3(x) \rangle \rangle $. Editing the generator polynomial of $ \mathfrak{C_3} $, we obtain $ \mathfrak{C_3} = \langle u^{2}\tau_1(x), \:\: (1+3u^{2}) \tau_2(x), \:\: (1+3u^{2})\tau_3(x) \rangle $.

Proof. Due to $ \Re = \langle\tau_{1}(x)\rangle $ and $ \Im = \langle\tau_{2}(x), \tau_{3}(x) \rangle $, we can conclude that $ \mathfrak{C_3} = u^{2}\Re\oplus(1+3u^{2})\Im $. From this, we claim that $ \mathfrak{C_3} = \{\mathfrak{y}(x) = {u^{2}}{b}_{1}(x)\tau_{1}(x)+ (1+3u^{2})b_{2}(x)\langle{\tau}_{2}(x), \: {\tau}_{3}(x)\rangle \:such \: that\:$ ${b}_{1}(x), b_{2}(x)\in T_3[x, \theta_i]\} $. We can further infer that $ \mathfrak{C_3}\subseteq \langle {u}^{2}\tau_{1}(x)+(1+3u^{2})\langle\tau_{2}(x), \tau_{3}(x)\rangle\rangle\subseteq T_{3, {\varpi}_{\theta_i}} $. Conversely, let us consider $ {u^{2}y_{1}(x)\tau_{1}(x)+(1+3u^{2})y_{2}(x)\langle\tau_{2}(x), \tau_{3}(x)\rangle\in\langle u^{2}\tau_{1}(x), (1+3u^{2})\langle\tau_{2}(x), \tau_{3}(x)\rangle\rangle} $ with $ {y_{1}(x), y_{2}(x)\in T_{3, {\varpi}_{\theta_i}}} $. We have $ {u^{2}y_{1}(x) = u^{2}b_{1}(x)} $ and $ {(1+3u^{2})y_{2}(x) = (1+3u^{2})b_{2}(x)} $ for some $ {b_{1}(x), {b}_{2}(x)\in T_3[x, \theta_i]} $. Hence, it can be deduced that $ {\langle u^{2}\tau_{1}(x), (1+3u^{2})\langle\tau_{2}(x), \tau_{3}(x)\rangle \rangle\subseteq\mathfrak{C_3}} $. Therefore, the proof is $ {\mathfrak{C_3} = \langle u^{2}\tau_{1}(x), (1+3u^{2})\langle\tau_{2}(x), \tau_{3}(x)\rangle\rangle} $. □

Theorem 7. Let $ \Re $ and $ \Im $ be $ \theta_i $-cyclic codes over $ \mathbb{Z}_{4} $ and $ \mathbb{Z}_{4}+u\mathbb{Z}_{4} $, respectively. Assume that $ \langle \tau_1(x)\rangle $ and $ \langle \tau_2(x), \tau_3(x) \rangle $ are the monic generator polynomials of these codes and also $ \mathfrak{C_3} = u^{2}\Re\oplus(1+3u^2)\Im $. In this case, there is a unique polynomial $ \tau(x) $ over $ T_3[x, \theta_i] $ such that $ \mathfrak{C_3} = \langle\tau(x)\rangle $ and $ \tau(x) $ is a right divisor of $ {x^\varpi}-1 $, where $ \tau(x) = {u^2\tau_1(x)+(1+3u^2)(\tau_2(x)+ \tau_3(x))} $.

Proof. Using the previous theorem, we can express $ \mathfrak{C_3} = \langle u^2\tau_1(x), (1+3u^2)\langle\tau_2(x), \tau_3(x)\rangle\rangle $. Assume that $ \tau(x) = u^2\tau_1(x)+(1+3u^2)(\tau_2(x)+ \tau_3(x)) $. Then, it's trivial that $ \langle\tau(x)\rangle\subseteq\mathfrak{C_3} $. On the other hand, we have that $ u^2\tau_1(x) = u^2\tau(x) $ and $ (1+3u^2)(\tau_2(x)+\tau_3(x)) = (1+3u^2)\tau(x) $, which implies that $ \mathfrak{C_3}\subseteq\langle\tau(x)\rangle $. Hence, $ \mathfrak{C_3} = \langle\tau(x)\rangle $. Because $ \tau_1(x) $ and $ (\tau_2(x)+ \tau_3(x)) $ are monic divisors $ {x^\varpi}-1 $ in $ \mathbb{Z}_4[x, \theta_i] $ and $ \mathbb{Z}_4+u\mathbb{Z}_4[x, \theta_{i}] $, respectively, then there exists $ b_1(x), b_2(x)\in T_{3, {\varpi}_{\theta_i}} $ such that $ {x^\varpi}-1$ = $b_1(x)\tau_1(x)$ = $b_2(x)(\tau_2(x)+\tau_3(x)) $. Therefore, $ (u^2b_1(x)+(1+3u^2)b_2(x))\tau(x)$ = $(u^2b_1(x)+(1+3u^2)b_2(x))(u^2\tau_1(x)+(1+3u^2)$ $(\tau_2(x)+\tau_3(x))$ = $u^2({x^\varpi}-1)+(1+3u^2)({x^\varpi}-1)$ = ${x^\varpi}-1 $. From this point of view, $ \tau(x) $ is a right divisor of $ {x^\varpi}-1 $. □

First of all, we define two sets for units. In this case,

$ \mathfrak{B_2} = \{1, 3, 1+2u, 3+2u, 1+2u^2, 3+2u^2, 1+2u+2u^2, 3+2u+2u^2\} $,

$ \mathfrak{B_{4}} = \{1+u+u^2, 1+u+3u^2, 1+3u+3u^2, 3+3u+u^2, 3+u+3u^2, 3+3u+3u^2, 1+3u+u^2, 3+u+u^2\} $.

Now we use these sets to describe a ring homomorphism. Therefore, we can state the following propositions and corollaries, whose proofs are trivial.

Proposition 8. Let $ \nu:{T_{3, {\varpi}}}_{\theta_i} \to {T_{3, {{\varpi}}}}_{\theta_i, \lambda} $. In this case,

(i) For each unit $ \lambda\in\mathfrak{B_2} $, this map is defined as $ \nu(\mathfrak{y}(x)) = \mathfrak{y}(\lambda x) $. Then, $ \nu $ is a ring isomorphism for all units with an odd length and all automorphisms over the ring $ T_3 $.

(ii) For each unit $ \lambda\in\mathfrak{B_4} $, define this map with $ \nu(\mathfrak{y}(x)) = \mathfrak{y}({\lambda^2} x) $. Then, $ \nu $ is a ring isomorphism, with the length $ \varpi $ as

Proof. The proof can be easily observed through the defined automorphisms $ \theta_i $ and the skew multiplication. □

Corollary 1. There is a one-to-one relation between the ideals of $ {T_{3, {\varpi}_{\theta_i}}} $ and $ {T_{3, {\varpi}_{\theta_i, \lambda}}} $.

Proposition 9. Let $ \mathfrak{C_3} $ denote a linear code of length $ \varpi $ over $ T_3 $ and let

Then, $ \mathfrak{C_3} $ is a cyclic code if, and only if, $ \widehat{\nu}(\mathfrak{C_3}) $ is a $ \lambda $-constacyclic code of length $ {\varpi} $ over $ T_3 $.

Theorem 10. Let $ \mathfrak{{C}_3} = u^2\Re\oplus(1+3u^2)\Im $ be a $ (\theta_i, \lambda) $-constacyclic code of length $ \varpi $ over $ T_3 $. We identify the methods to construct the generator polynomial of $ (\theta_i, \lambda) $-constacyclic codes of length $ \varpi $ over $ T_3 $ as follows:

(i) We determine this generator polynomial by using $ \mathfrak{{C}_3}$ = $(u^2\langle \mathfrak{f_1}(x)(\mathfrak{t_1}(x)+2)\rangle) \oplus $$((1+3u^2)\langle \mathfrak{f_2}(x)(\mathfrak{t_2}(x)+2)$+$u\mathfrak{f_{1, 2}}(x)$$(\mathfrak{t_{1, 2}}(x)+2)$, $u\mathfrak{f_3}(x)(\mathfrak{t_3}(x)+2)\rangle) $ where $ {x^\varpi}-\lambda = \mathfrak{f_i}(x)\mathfrak{d_i}\mathfrak{t_i}(x) $ for $ i = 1, 2, 3 $. This is the most classical method.

(ii) In another way, with the help of the Proposition 8 and Corollary 1, we construct this generator polynomial via $ {\mathfrak{C}_3} = (u^2\langle \mathfrak{f_1}(\tilde{x})$$(\mathfrak{t_1}(\tilde x)+2)\rangle) \oplus $$((1+3u^2)\langle \mathfrak{f_2}(\tilde x)$$(\mathfrak{t_2}(\tilde x)+2)+u\mathfrak{f_{1, 2}}(\tilde x)(\mathfrak{t_{1, 2}}(\tilde x)+2)$, $u\mathfrak{f_3}(\tilde x)(\mathfrak{t_3}(\tilde x)+2)\rangle) $ such that

and $ {x^\varpi}-1 = {f_i}(x){h_i}(x)\mathfrak{s}_i(x) $ for $ i = 1, 2, 3 $.

3.1.   $ \mathbb{Z}_{4} $-images of $ (\theta_{i}, \lambda) $-constacyclic codes over $ T_3 $

In this section, we look for $ \mathbb{Z}_{4} $-images of $ \theta_i $-cyclic and $ (\theta_i, \lambda) $-constacyclic codes over $ T_3 $.

Definition 3. Let $ \mathfrak{y}\in\mathbb{Z}_{4}^{2\varpi} $ with $ \mathfrak{y} = (\mathfrak{y}_{0}, {{\mathfrak{y}}_{1}}, \dots, {\mathfrak{y}_{\delta}}) $ where $ \mathfrak{y}_{i}\in\mathbb{Z}_{4} $ for $ i = 0, 1 $. Let $ \upsilon_{\delta} $ be a map from $ \mathbb{Z}_{4}^{2\varpi} $ to $ \mathbb{Z}_{4}^{2\varpi} $ defined by $ \upsilon_{\delta}(\mathfrak{y}) = (\sigma(\mathfrak{y}_{0}), \sigma(\mathfrak{y}_{1}), \dots, \sigma(\mathfrak{y}_{\delta})) $, where $ \sigma $ is the cyclic shift from $ \mathbb{Z}_{4}^{2\varpi} $ to $ \mathbb{Z}_{4}^{2\varpi} $ provided by $ \sigma(\mathfrak{y}_{i}) = ({\mathfrak{y}_i}^{\varpi-1}, {\mathfrak{y}_i}^0, \dots, {\mathfrak{y}_i}^{\varpi-2}) $ for each $ \mathfrak{y}_{i} = ({\mathfrak{y}_i}^0, \dots, {{\mathfrak{y}_i}^{\varpi-1}}) $ where $ {\mathfrak{y}_i}^j\in \mathbb{Z}_{4} $ and $ j = 0, 1, \dots, {\varpi-1} $. The $ 2\varpi $-length code over $ \mathbb{Z}_{4} $ is called a quasi-cyclic code with an index of $ \delta $ if $ \upsilon_\delta(\mathfrak{C}) = \mathfrak{C} $.

Let $ \Phi_j $ be defined Gray maps from $ {T_3}^{\varpi} $ to $ {{\mathbb{Z}_4}^{2\varpi}} $, $ \sigma_{\theta_i} $ be the $ \theta_i $-cyclic shift, $ {\rho}_{\theta_i, \lambda} $ be the $ (\theta_i, \lambda) $-constacyclic shift, and $ \upsilon_2 $ be the quasi-cyclic shift operator with index $ 2 $. Thus, the following proposition and theorem can be stated as the result of crucial observations.

Proposition 11. (i) We have $ {\Phi_j}{\sigma_{\theta_i}}(\mathfrak{y}) = \upsilon_2\Phi_j(\mathfrak{y}) $ for any $ \mathfrak{y}\in{T_3}^{\varpi} $ and $ i, j = 1, 2, 3 $.

(ii) We have $ {\Phi_1}\rho_{\theta_i, \lambda}(\mathfrak{y}) = \sigma\Phi_{1}(\mathfrak{y}) $ for any $ \mathfrak{y}\in{T_3}^{\varpi} $ and $ i = 1, 2, 3 $ where $ \lambda = 3, 1+2u, 1+2u^2, 3+2u+2u^2 $.

(iii) We have $ {\Phi_2}\rho_{{\theta_i, \lambda}}(\mathfrak{y}) = \sigma\Phi_{2}(\mathfrak{y}) $ for any $ \mathfrak{y}\in{T_3}^\varpi $ and $ i = 1, 2, 3 $ when $ \lambda = 1+u+u^2, 3+3u+u^2, 3+u+3u^2, 1+3u+3u^2 $.

(iv) We have $ {\Phi_3}\rho_{\theta_i, \lambda}(\mathfrak{y}) = \sigma\Phi_{3}(\mathfrak{y}) $ for any $ \mathfrak{y}\in{T_3}^{\varpi} $ and $ i = 1, 2, 3 $ where $ \lambda = 3+u+u^2, 1+3u+u^2, 1+u+3u^2, 3+3u+3u^2 $.

(v) We have $ {\Phi_j}\rho_{\theta_i, \lambda}(\mathfrak{y}) = \upsilon_2\Phi_{j}(\mathfrak{y}) $ for any $ \mathfrak{y}\in{T_3}^{\varpi} $ and $ i, j = 1, 2, 3 $ where $ \lambda = 1+2u+2u^2, 3+2u, 3+2u^2 $.

Proof. Determine $ \mathfrak{y} $ which consists of $ (\mathfrak{y}_0, \mathfrak{y}_1, \dots, \mathfrak{y}_{\varpi-1}) $ in $ {{T_3}[x, \theta_i]}^{\varpi} $, where $ {\mathfrak{y}_j} $ is calculated by the formula $ {a_0^i}+u{a_1^i}+{u^2a_2^i} $ for values of $ j $ that are from $ 0 $ to $ \varpi-1 $. We know that the images of $ \mathfrak{y} $ under the specified Gray maps are as follows.

$ {\Phi_1}(\mathfrak{y}) = ({{a_0}^0}+{{a_1}^0}+{3{a_2}^0}, \dots, {{a_0}^{\varpi-1}}+{{a_1}^{\varpi-1}}+{3{a_2}^{\varpi-1}}, {3{a_0}^0}+{3{a_1}^0}+{{a_2}^0}, \dots, {3{a_0}^{\varpi-1}}+{3{a_1}^{\varpi-1}}+{{a_2}^{\varpi-1}}) $,

$ {\Phi_2}(\mathfrak{y}) = ({a_{0}^{0}}+{a_{1}^{0}}+{3a_{2}^{0}}, \dots, {a_{0}}^{\varpi-1}+{a_{1}}^{\varpi-1}+3a_{2}^{\varpi-1}, {a_{0}^{0}}+{3a_{1}^{0}}+{a_{2}^{0}}, \dots, {a_{0}^{\varpi-1}+{3a_{1}^{\varpi-1}+{a_{2}}^{\varpi-1}}}) $,

$ {\Phi_3}(\mathfrak{y}) = ({{a_{0}}^{0}}+{{a_{1}}^{0}}+{3{a_{2}}^{0}}, \dots, {{a_{0}}^{\varpi-1}}+{{a_{1}}^{\varpi-1}}+{3{a_{2}}^{\varpi-1}}, {3{a_{0}}^{0}}+{a_{1}^{0}}+{3{a_{2}}^{0}}, \dots, {3{a_{0}}^{\varpi-1}}+{{a_{1}}^{\varpi-1}}+{3{a_{2}}^{\varpi-1}}) $.

To demonstrate that $ {\Phi_j}\sigma_{\theta_i}(\mathfrak{y}) = \upsilon_2\Phi_{j}(\mathfrak{\mathfrak{y}}) $ for all $ \mathfrak{y}\in T_3^{\varpi} $ and $ i, j = 1, 2, 3 $, let's obtain $ \upsilon_2\Phi_1(\mathfrak{y}), \upsilon_2\Phi_2(\mathfrak{y}) $ and $ \upsilon_2\Phi_3(\mathfrak{y}) $ first. We have

$ \upsilon_2\Phi_1(\mathfrak{y}) = ({a_{0}}^{\varpi-1}+{a_{1}}^{\varpi-1}+3{a_{2}}^{\varpi-1}, {a_{0}}^{0}+{a_{1}}^{0}+3{a_{2}}^{0}, \dots, {a_{0}}^{\varpi-2}+{a_{1}}^{\varpi-2}+3{a_{2}}^{\varpi-2}, 3{a_{0}}^{\varpi-1}+{3{a_{1}}^{\varpi-1}+{a_{2}}^{\varpi-1}, 3{a_{0}}^{0}+3{a_{1}}^{0}+{a_{2}}^{0}, \dots, 3{a_{0}}^{\varpi-2}+3{a_{1}}^{\varpi-2}+{a_{2}}^{\varpi-2}}) $,

$ \upsilon_2\Phi_2(\mathfrak{y}) = ({a_{0}}^{\varpi-1}+{a_{1}}^{\varpi-1}+3{a_{2}}^{\varpi-1}, {a_{0}}^{0}+{a_{1}}^{0}+3{a_{2}}^{0}, \dots, {a_{0}}^{\varpi-2}+{a_{1}}^{\varpi-2}+3{a_{2}}^{\varpi-2}, {a_{0}}^{\varpi-1}+ {3{a_{1}}^{\varpi-1}+{a_{2}}^{\varpi-1}, {a_{0}}^{0}+3{a_{1}}^{0}+{a_{2}}^{0}, \dots, {a_{0}}^{\varpi-2}+3{a_{1}}^{\varpi-2}+{a_{2}}^{\varpi-2}}) $,

$ \upsilon_2\Phi_3(\mathfrak{y}) = ({a_{0}^{\varpi-1}}+a_{1}^{\varpi-1}+3a_{2}^{\varpi-1}, { a_{0}^{0}}+{a_{1}^{0}}+{3a_{2}^{0}}, \dots, {a_{0}}^{\varpi-2}+{a_{1}^{\varpi-2}}+3a_{2}^{\varpi-2}, 3{a_{0}^{\varpi-1}}+ {{a_{1}}^{\varpi-1}+3{a_{2}}^{\varpi-1}, 3{a_{0}}^{0}+{a_{1}}^{0}+3{a_{2}}^{0}, \dots, 3{a_{0}}^{\varpi-2}+{a_{1}}^{\varpi-2}+3{a_{2}}^{\varpi-2}}) $.

On the other hand, we obtain

$ \sigma_{\theta_1}(\mathfrak{y}) = (\theta_1({\mathfrak{y}}_{\varpi-1}), \theta_1({\mathfrak{y}}_{0}), \theta_1({\mathfrak{y}}_{1}), \dots, \theta_1({\mathfrak{y}}_{\varpi-2})) = ({a_{0}}^{\varpi-1}+2{a_{1}}^{\varpi-1}+{3ua_1}+{u^2}{a_{2}}^{\varpi-1}, {a_{0}}^{0}+u{a_{1}}^{0}+{u^2}{a_{2}}^{0}, \dots, {a_{0}}^{\varpi-2}+u{a_{1}}^{\varpi-2}+{u^2}{a_{2}}^{\varpi-2}) $,

$ \sigma_{\theta_2}(\mathfrak{y}) = (\theta_2({\mathfrak{y}}_{\varpi-1}), \theta_2(\mathfrak{y}_{0}), \theta_2(\mathfrak{y}_{1}), \dots, \theta_2({\mathfrak{y}_{\varpi-2}})) = ({a_{0}}^{\varpi-1}+2{a_{1}}+u{a_{1}}^{\varpi-1}+{u^2}(2{a_{1}}^{\varpi-1}+{a_{2}}^{\varpi-1}), {a_{0}}^{0}+u{a_{1}}^{0}+{u^2}{a_{2}}^{0}, \dots, {a_{0}}^{\varpi-2}+u{a_{1}}^{\varpi-2}+{u^2}{a_{2}}^{\varpi-2}) $,

$ \sigma_{\theta_3}(\mathfrak{y}) = (\theta_3({\mathfrak{y}}_{\varpi-1}), \theta_3(\mathfrak{y}_{0}), \theta_3(\mathfrak{y}_{1}), \dots, \theta_3({\mathfrak{y}_{\varpi-2}})) = ({a_{0}}^{\varpi-1}+3ua_{1}+{u^2 }(2{a_{1}}^{\varpi-1}+{a_{2}}^{\varpi-1}), {a_{0}}^{0}+u{a_{1}}^{0}+{u^2}{a_{2}}^{0}, \dots, {a_{0}}^{\varpi-2}+u{a_{1}}^{\varpi-2}+{u^2}{a_{2}}^{\varpi-2}) $.

The image of them under $ \Phi_1 $:

$ \Phi_1\sigma_{\theta_1}(\mathfrak{y}) = \Phi_1\sigma_{\theta_2}(\mathfrak{y}) = \Phi_1\sigma_{\theta_3}(\mathfrak{y}) = ({a_{0}^{\varpi-1}}+{a_{1}^{\varpi-1}}+{3a_{2}^{\varpi-1}}, {a_{0}^{0}}+{a_{1}^{0}}+{3a_{2}^{0}}, \dots, {a_{0}^{\varpi-2}}+ {a_{1}^{\varpi-2}}+{3a_{2}^{\varpi-2}}, {3a_{0}^{\varpi-1}}+{3a_{1}^{\varpi-1}}+{a_{2}^{\varpi-1}}, {3a_{0}^{0}}+{3a_{1}^{0}}+{a_{2}^{0}}, \dots, {3a_{0}^{\varpi-2}}+{3a_{1}^{\varpi-2}}+{a_{2}^{\varpi-2}}) $,

The image of them under $ \Phi_2 $:

$ \Phi_2\sigma_{\theta_1}(\mathfrak{y}) = \Phi_2\sigma_{\theta_2}(\mathfrak{y}) = \Phi_2\sigma_{\theta_3}(\mathfrak{y}) = ({a_{0}}^{\varpi-1}+{a_{1}}^{\varpi-1}+3{a_{2}}^{\varpi-1}, {a_{0}}^{0}+{a_{1}}^{0}+3{a_{2}}^{0}, \dots, {a_{0}}^{\varpi-2}+ {a_{1}}^{\varpi-2}+3{a_{2}}^{\varpi-2}, {a_{0}}^{\varpi-1}+3{a_{1}}^{\varpi-1}+{a_{2}}^{\varpi-1}, {a_{0}}^{0}+3{a_{1}}^{0}+{a_{2}}^{0}, \dots, {a_{0}}^{\varpi-2}+3{a_{1}}^{\varpi-2}+{a_{2}}^{\varpi-2}) $.

The image of them under $ \Phi_3 $:

$ \Phi_3\sigma_{\theta_1}(z\mathfrak{y}) = \Phi_3\sigma_{\theta_2}(\mathfrak{y}) = \Phi_3\sigma_{\theta_3}(\mathfrak{y}) = ({a_{0}^{\varpi-1}}+{a_{1}^{\varpi-1}}+{3a_{2}^{\varpi-1}}, {a_{0}^{0}}+{a_{1}^{0}}+{3a_{2}^{0}}, \dots, {a_{0}^{\varpi-2}}+ {a_{1}^{\varpi-2}}+{3a_{2}^{\varpi-2}}, {3a_{0}^{\varpi-1}}+{a_{1}^{\varpi-1}}+{3a_{2}^{\varpi-1}}, {3a_{0}^{0}}+{a_{1}^{0}}+{3a_{2}^{0}}, \dots, {3a_{0}^{\varpi-2}}+{a_{1}^{\varpi-2}}+{3a_{2}^{\varpi-2}}) $.

Therefore, we have $ \Phi_{j}\sigma_{\theta_i}(\mathfrak{y}) = \upsilon_2\Phi_{j}(\mathfrak{y}) $ for $ i, j = 1, 2, 3 $.

The proof of others can be achieved using the same methodology. □

Theorem 12. (i) Let $ \mathfrak{C_3} $ denote a $ \theta_i $-cyclic code of length $ \varpi $ over $ T_3 $, where $ i $ and $ j $ range from $ 1 $ to $ 3 $. In this regard, the Gray image of a $ \theta_i $-cyclic code over $ T_3 $ with a length $ \varpi $ is equal to a QC code of index $ 2 $ over $ \mathbb{Z}_{4} $ with a length $ 2\varpi $.

(ii) Let $ \mathfrak{C_3} $ denote $ (\theta_i, \lambda) $-constacyclic codes of length $ m $ over $ T_3 $ for $ \lambda = 3, 1+2u, 1+2u^2, 3+2u+2u^2 $, where $ i $ takes on the values $ 1, 2, $ and $ 3 $. By taking the $ \mathbb{Z}_{4} $-images of $ {\Phi_1}(\mathfrak{C_3}) $, the cyclic codes over $ \mathbb{Z}_4 $ are obtained.

(iii) Let $ \mathfrak{C_3} $ denote $ (\theta_i, \lambda) $-constacyclic codes of length $ \varpi $ over $ T_3 $ for $ \lambda = 1+u+u^2, 1+3u+3u^2, 3+u+3u^2, 3+3u+u^2 $, and $ i = 1, 2, 3 $. So their Gray images $ {\Phi_2}(\mathfrak{C_3}) $ are observed as cyclic codes over $ \mathbb{Z}_{4} $.

(iv) If $ \mathfrak{C_3} $ is a $ (\theta_i, \lambda) $-constacyclic code of length $ \varpi $ over $ T_3 $ for $ \lambda = 1+u+3u^2, 1+3u+u^2, 3+u+u^2 $, and $ 3+3u+3u^2 $, then their Gray images $ {\Phi_3}(\mathfrak{C_3}) $ are cyclic codes over $ \mathbb{Z}_{4} $.

(v) Let $ \mathfrak{C_3} $ denote $ (\theta_i, \lambda) $-constacyclic codes of length $ \varpi $ over $ T_3 $ for $ i, j = 1, 2, 3 $ and $ \lambda = 3+2u, 3+2u^2, 1+2u+2u^2 $. So their Gray images $ {\Phi_j}(\mathfrak{C_3}) $ are QC codes of index $ 2 $ with a length of $ 2\varpi $ over $ \mathbb{Z}_{4} $.

Proof. Assume that $ \mathfrak{C_3} $ is a $ \theta_i $-cyclic code of length $ \varpi $ over $ T_3 $ for $ i, j = 1, 2, 3 $. This is $ \sigma_{\theta_i}(\mathfrak{C_3}) = \mathfrak{C_3} $. According to the previous proposition, $ \Phi_j\sigma_{\theta_i}(\mathfrak{C_3}) = \upsilon_2\Phi_j(\mathfrak{C_3}) = \Phi_{j}(\mathfrak{C_3}) $. Therefore, $ \Phi_j(\mathfrak{C_3}) $ is equivalent to a QC code of index $ 2 $ over $ \mathbb{Z}_{4} $ with a length of $ 2\varpi $.

The evidence from others is similarly conducted. □

3.2.   Computational results for $ \theta_{i} $-cyclic codes

In this section, we search for $ \theta_i $-cyclic and $ (\theta_i, \lambda) $-constacyclic codes over $ T_3 $ and their $ \mathbb{Z}_4 $-images. In particular, the automorphism $ \theta_1 $ and the Gray image $ \phi_1 $ for length $ 7 $ is studied. Based on Theorem 6, Theorem 10, and using MAGMA software ^[28], we present the results of a computational study on $ \theta_{1} $-cyclic codes over $ T_3 $. Here, we express each term of the generator polynomial given in this theorem with $ \tau_{i} $, where $ i = 1, 2, 3 $. In the present case, $ \langle\tau_{1}, \tau_{2}, \tau_{3}\rangle $ will be the representative of the generator polynomial of $ T_3 $. Thus, we have many $ \theta_1 $-cyclic codes over $ T_3 $, whose $ \mathbb{Z}_4 $-images are new, optimal, and the best-known linear codes. We present all of these codes in the tables that follow. Note that the representation of the elements of $ T_3 $ is the same as in Table $ 1 $ in ^[1]. In these tables, the Lee, Euclidean, and Hamming weights are determined for each generator polynomial. While giving information about new and optimal parameters in $ \mathbb{Z}_4 $, the online database ^[29] has been checked. In addition, the "$ ^{*} $" sign is used to indicate new parameters and the "$ ^{**} $" sign is used to indicate optimal parameters. To express the spelling more clearly, the polynomial's coefficients will be listed in decreasing order starting with the highest order $ x $. It is important to note that this length increases to 14 in according to the defined Gray maps since $ 7 $ lengths of a code are scanned. For example, the polynomial $ (3u^2+3u)x^7+(2u+1)x^6+ux^2+3 $ will be written as $ 9'E0^3403 $. It should be noted that the $ 0^3 $ notation indicates that the $ 0 $ expression is repeated $ 3 $ times. The $ \mathbb{Z}_4 $ images of some $ \theta_{1} $-cyclic codes over $ T_3 $ are given in Tables 1–3, and the $ \mathbb{Z}_4 $ images of some $ (\theta_{1}, 3+3u+u^2) $-constacyclic codes over $ T_3 $ are given in Tables 4 and 5.

4.   DNA codes over $ T_3 $

DNA forms the genes that carry the code for biological processes in living organisms. The information needed to make the substances that cells need is stored in DNA. The double helix structure that forms the physical shape of the DNA structure consists of bases. There are $ 4 $ fundamental bases in living genetics. These are Adenine $ (A) $, Guanine $ (G) $, Cytosine $ (C) $, and Thymine $ (T) $. These bases are arranged on the double helix of DNA by a normal size. This is called the Watson-Crick complement (WCC). In relation to this normality, $ A $ and $ T $, $ G $ and $ C $ are connected. There are also two hydrogen bonds between the bases $ A $ and $ T $, and three hydrogen bonds between the bases $ G $ and $ C $.

Now, we will first talk about some notations and give some basic definitions. Then we will explain the DNA reversibility problem, define a unit reverse polynomial, and relate the elements of the ring $ T_3 $ to the DNA codons.

Definition 4. Let $ D $ be a code of arbitrary length $ \varpi $ over a finite set $ \Lambda $.

(i) If for all $ \mathfrak{y}^{R} = ({\mathfrak{y}_{\varpi-1}}, {\mathfrak{y}_{\varpi-2}}, \dots, {\mathfrak{y}_0})\in D $ for $ {\mathfrak{y}} = ({\mathfrak{y}_0}, \dots, {\mathfrak{y}_{\varpi-1}})\in D $, then $ D $ is called reversible code.

(ii) If for all $ {\mathfrak{y}^{RC} = ({\mathfrak{y}_{\varpi-1}}, {\mathfrak{y}_{\varpi-2}}, \dots, {\mathfrak{y}_0})^C}\in D $ for $ z = ({\mathfrak{y}_0}, \dots, {\mathfrak{y}_{\varpi-1}})\in D $, then $ D $ is called reversible complement code.

Definition 5. Let $ r(x)\in T_3 $ be a polynomial of degree $ b $ and let $ r(x) $ be expressed as $ r_0+r_1x+\dots+r_{b-1}x^{b-1} $. For the coefficients of the polynomial $ r(x) $ where $ j = 0, 1, \dots, b-1 $, if $ r_j = r_{b-j} $, then the polynomial $ r(x) $ is referred to as a palindromic polynomial.

The DNA code of length $ \varpi $ is described as a set of code words $ (f_0, f_1, \dots, f_{\varpi-1}) $ such that $ f_i\in\{A, G, C, T\} $. The following restrictions for these code words exist in DNA.

Let $ D $ be a DNA code word and $ d $ be a positive integer,

(ⅰ) Hamming Distance Constraint: $ \forall \mathfrak{y}, \mathfrak{g}\in D $ and $ \mathfrak{y}\neq\mathfrak{g} : $ $ d_H(\mathfrak{y}, \mathfrak{g})\geq d $,

(ⅱ) Reverse Constraint: $ \forall \mathfrak{y}, \mathfrak{g}\in D $ and $ \mathfrak{y}\neq \mathfrak{g} : $ $ d_H(\mathfrak{y}^R, \mathfrak{g})\geq d $,

(ⅲ) Reverse Complement Constraint: $ \forall \mathfrak{y}, \mathfrak{g}\in D $ and $ \mathfrak{y}\neq \mathfrak{g} : $ $ d_H({\mathfrak{y}^{RC}}, \mathfrak{g})\geq d $ such that $ {\mathfrak{y}^{RC}} $ is the WC-complement of $ \mathfrak{y}^R $,

(ⅳ) $ GC $-content Constraint: $ \forall \mathfrak{y}\in D : $ The total number of $ G $ and $ C $ bases contained in each $ \mathfrak{y} $ code word is equal.

We will use Hamming distance, reverse, and reverse complement constraints here. The $ GC $-content constraint will be left as an open problem.

To explain the reversibility problem; let $ ({z}_1, {z}_2, {z}_3, {z}_4, {z}_5) $ be a code word corresponding to $ GGTCCTGGAA $ as a DNA strain where $ {z}_1 = 3u+u^2$, ${z}_2 = u^2+3u+3$, ${z}_3 = 3u^2+2$, ${z}_4 = 2u^2+u+3$, ${z}_5 = 2u^2+u+1 \in T_3 $. The reverse of $ ({z}_1, {z}_2, {z}_3, {z}_4, {z}_5) $ is $ ({z}_5, {z}_4, {z}_3, {z}_2, {z}_1) $, and this DNA strain corresponds to $ AAGGCTTCGG $. However, the reverse of the DNA strain $ GGTCCTGGAA $ is $ AAGGTCCTGG $. It is trivial that the DNA strain of the reverse of $ ({z}_1, {z}_2, {z}_3, {z}_4, $ $ {z}_5) $ is not equal to the DNA strain $ AAGGCTTCGG $. We have a reversibility problem when we convert the element of a ring to binary or more DNA via the Gray map. Although there are several methods to solve this problem, we have identified unit reverse polynomials and a suitable new generation method for these polynomials to solve the DNA reversibility problem.

First of all, let's define the sets as follows.

$ U_A = \{1, 3+2u, 1+u+u^2, 3+3u+u^2, 3+2u^2, 1+2u+2u^2, 3+u+3u^2, 1+3u+3u^2\}, $

$ U_B = \{3, 1+2u, 3+u+u^2, 1+3u+u^2, 1+2u^2, 3+2u+2u^2, 1+u+3u^2, 3+3u+3u^2\}, $

$ \kappa = \{0, 2\}. $

Now we define the unit reverse polynomial with the help of these sets. This polynomial will help us to find a reversible DNA code.

Definition 6. [Unit reverse polynomial]

Let $ g(x) $ be a polynomial of degree $ t $ over $ T_3 $ and $ \mathfrak{y} $ be an element of $ T_3 $. In this case,

(i) If the degree of the polynomial $ g(x) $ is even, then the unit reverse polynomial is

(ii) If the degree of the polynomial $ g(x) $ is odd, then the unit reverse polynomial is

where $ \mathfrak{y}_S\in U_A $, $ \mathfrak{y}_Y\in U_B, \:\: \beta_S\in U_A $, $ \beta_Y\in U_B $. Here, if $ \mathfrak{y}_S = U_{B} $, then $ \mathfrak{y}_Y = U_{A} $, and if $ \beta_S = U_{B} $, then $ \beta_Y = U_{A} $.

Example 1. $ 1+(1+u+u^2)x+(2u+3)x^2+2x^3+(3u^2+3u+3)x^4+(u^2+3u+1)x^5+(2u+1)x^6 $ is a unit reverse polynomial with even degree in $ T_3[x] $. $ (3+2u^2)+(2u+3)x+(2u+1)x^2+(3u^2+u+1)x^3 $ is a unit reverse polynomial with odd degree in $ T_3[x] $.

Now, first of all, we define a $ \mathfrak{T}- $module code with the help of the paper by Oztas et.al. that motivates us. We also remaind that $ \mathfrak{T}- $module code is called an $ x $-module code if $ \mathfrak{T} $ is generated by an $ x\in \mathbb{R} $.

Definition 7. ^[19] Let $ \mathfrak{C} $ be a code generated by $ p(x) $ in $ R[x]/\langle x^{n}-1\rangle $ where $ \mathfrak{T} $ is a subring of $ R $ and $ E $ is a generator set for $ \mathfrak{T} $. Here $ \mathfrak{C} = \{(y_{0}+y_{1}x+\dots+y_{n-1}x^{n-1})p(x) \:\:|\:\: y_{i}\in\mathfrak{T}\} $ or $ \mathfrak{C} = \{(y_{0}c_{1}+y_1c_{2}+ \dots, y_{a}c_{a})p(x)\:\: | \:\: y_{i}\in\mathfrak{T}\} $ is a subset of $ R^{n} $.

By finding a ring in which any $ k- $base of DNA lives, they identified the $ k- $base of the DNA strain with an element of the ring they were studying. It was observed that the problem of reversibility arises with the definition of $ k- $bases. To solve this reversibility problem, they presented new notations and new definitions, as mentioned above. Using the $ \mathfrak{T}- $module code, they give some notations for $ n $-tuples of DNA $ k $-bases. These notations help to find the reverse of the DNA $ k $-bases, which is provided in the ring structure.

Although the $ T_3 $ ring we are working with has 64 elements, it cannot be decomposed into three separate parts. Therefore, the ring elements cannot correspond to DNA 3-mers. Hence, due to the defined Gray structure, the ring elements correspond to the DNA 2-mers, and this happens with restricted elements.

Consider in this strategy we define the function $ \zeta $ to describe the components of $ T_3 $ and $ 2 $-mers. To create the map $ \zeta $, we match the elements of $ \mathbb{Z}_4 $ and DNA bases according to the following methodology.

Here, we define $ \zeta(0) = A, \:\:\zeta(1) = T, \:\zeta(2) = G, \:\zeta(3) = C $. The $ \zeta $ map can be mapped in $ 24 $ different ways between $ \mathbb{Z}_4 $ and DNA sequences. For example, $ \zeta(0) = C$, $\zeta(1) = A$, $\zeta(2) = T$, $\zeta(3) = G $ or $ \zeta(0) = A$, $\zeta(1) = G$, $\zeta(2) = C$, $\zeta(3) = T $, etc. The use of this type of multi-map also provides a variety of examples obtained with the Theorem 13. Using the Gray map $ \phi_1 $ and the transformation $ \zeta $, which pairs DNA bases with elements of $ \mathbb{Z}_4 $, this paper presents a description of the map $ \vartheta = {\zeta} o \phi_1 $ to match the elements of $ T_3 $ with DNA.

This map extended component-wise to

where $ \mathfrak{y}_i = a_0^i+ua_1^i+u^2a_2^i $ for $ i = 0, \dots, \varpi-1 $.

Now, we create a generation method for the unit reverse polynomial to construct reversible codes over $ T_3 $.

Definition 8. [Generation of $ \mathfrak{H_4} $-Module with Unit Reverse Polynomial] $ \mathfrak{H_4}{({U_{R}(x)})} $ and $ \mathfrak{{H_4}}^{+1}{({U_{R}(x)})} $ are generator matrices defined by $ U_{R}(x) $ over $ T_3 $ for codes of length $ \varpi $.

and

such that $ \mathfrak{K} = \{\mathfrak{b}, \mathfrak{b'}\} $ and the polynomial

where $ \mathfrak{K} = \{1, 3\} $.

Let us consider the polynomial $ U_R(x) = \mathfrak{s_0}+\mathfrak{s_1}x+\dots+\mathfrak{s_t}x^t $ such that $ \mathfrak{s_i}\in T_3 $. In this case, the generator matrix $ \mathfrak{H_4}{({U_{R}(x)})} $ of the polynomial $ {U_{R}(x)} $ is

and the generator matrix $ \mathfrak{H_4}^{+1}{({U_{R}(x)})} $ of the polynomial $ {U_{R}(x)} $ is

Theorem 13. If the code $ \mathfrak{C_3} $ $ (or $ $ \mathfrak{C_3}^{+1}) $ is generated by a $ U_R(x) $ with the generator matrix $ \mathfrak{H_4}{({U_{R}(x)})} $ $ (or $ $ \mathfrak{H_4}^{+1}{({U_{R}(x)})} $, $ \phi_1(\mathfrak{C_3}) $ $ (or $ $ \phi_1(\mathfrak{C_3}^{+1})) $ and is a reversible $ \mathbb{Z}_4- $code, then $ \vartheta(\mathfrak{C_3}) $ and $ \vartheta(\mathfrak{C_3}^{+1}) $ are reversible DNA codes.

Proof. For the polynomial $ U_R(x) = \mathfrak{s_0}x+\mathfrak{s_1}x^{2}+\dots+\mathfrak{s_t}x^{t} $, as you can see from the definition, let $ x^aU_R(x) $ be any row of the generator matrix $ \mathfrak{H_4}{({U_{R}(x)})} $ where $ a\in\{0, \dots, \varpi-t-1\} $. We get

and

If these polynomials are multiplied by any scalar $ \mathfrak{q}\in\mathbb{Z}_4^* $, we obtain

and

In this case, we attain

due to the choice of the $ \mathfrak{s_i} $'s. Since $ \vartheta = \zeta o \phi_1 $ and $ \mathbb{Z}_4- $reverse is found, DNA reverses can also be found as desired. Therefore,

equality is obtained.

□

For the complement of the DNA code, we can say the following:

DNA bases are normalized to correspond to elements of $ \mathbb{Z}_4 $. For example, if we choose $ 1 $ and $ 3 $, they are complements of each other. Also, $ 0 $ and $ 2 $ are complements of each other. Based on this information, if we add a row that has all $ 2 $ components for the generator matrix $ \mathfrak{H_4}{({U_{R}(x)})} $, then we can obtain a reversible and complement DNA code using the defined DNA correspondence normalized.

Example 2. Let $ U_R(x) = (2u+3)+(u^2+u+1)x+(3u^2+u+3)x^2+2x^3+(2u^2+1)x^4+(3u^2+u+1)x^5+(2u^2+2u+3)x^6 $ be a polynomial over $ T_3 $ with length $ 8 $. Then, the generator matrix $ \mathfrak{H_4}{({U_{R}(x)})} $ of the polynomial $ {U_{R}(x)} $ is

and the generator matrix $ \mathfrak{H_4}^{+1}{({U_{R}(x)})} $ of the polynomial $ {U_{R}(x)} $ is

Therefore, we get

and

When the rows in the $ \mathbb{Z}_4- $images of $ \mathfrak{H_4}{({U_{R}(x)})} $ and $ \mathfrak{H_4}^{+1}{({U_{R}(x)})} $ generator matrices are multiplied by $ \mathfrak{q}\in\mathbb{Z}_4^* $, the first row and the second rows are reverses of each other. For example, when $ \phi_1(\mathfrak{H_4}{({U_{R}(x)})}) $ is multiplied by $ 3 $, we obtain

From this, it is clear that the first row and the second row are reversed of each other.

When the first row and the second row in the $ \phi_1(\mathfrak{H_4}{({U_{R}(x)})}) $ matrix are added together, the resulting sequence

is palindromic, so the reverse is equal to itself.

Adding $ 2 $ rows to the generator matrix $ \mathfrak{H_{4}}{({U_{R}(x)})} $ gives the following matrix.

The $ \mathbb{Z}_4- $image of this matrix is

In the $ \mathbb{Z}_4- $image of this matrix, the sequence

obtained when the first and third rows are added together is the complement of the first row. When the second and third rows are added together in this matrix, the resulting sequence

is the complement of the second row.

In the $ \phi_1(\mathfrak{H_4}^{+1}{({U_{R}(x)})}) $ matrix, the

sequence obtained when the first row and the third row are added together and the

sequence obtained when the second row and the third row are summed are the reverse of each other. When it is multiplied by any $ \mathfrak{q}\in\mathbb{Z}_4^* $ and the same combined operations are performed, it is seen that the rows are reversed to each other.

Example 3. Let $ U_R(x) = (2u^2+1)+3x+(2u+1)x^2+(u^2+3u+3)x^3+(2u^2+3)x^4+(2u+3)x^5 $ be a polynomial over $ T_3 $ with length $ 9 $. Then, the generator matrix $ \mathfrak{H_4}{({U_{R}(x)})} $ of the polynomial $ {U_{R}(x)} $ is

and the generator matrix $ \mathfrak{H_4}^{+1}{({U_{R}(x)})} $ of the polynomial $ {U_{R}(x)} $ is

Therefore, we get

and

When the rows in the $ \mathbb{Z}_4- $images of $ \mathfrak{H_4}{({U_{R}(x)})} $ and $ \mathfrak{H_4}^{+1}{({U_{R}(x)})} $ generator matrices are multiplied by $ \mathfrak{q}\in\mathbb{Z}_4^* $, the first row and the fourth row, and the second row and the third row are reverses of each other. For instance, when $ \phi_1(\mathfrak{H_4}{({U_{R}(x)})}) $ is multiplied by $ 3 $, we obtain

From this, it is clear that the first row and the fourth row, and the second row and third row are reverses of each other.

If the first row and the fourth row in the matrix $ \phi_1(\mathfrak{H_4}{({U_{R}(x)})}) $ are added together, the resulting sequence is

and when the second row and the third rows in the $ \phi_1(\mathfrak{H_4}{({U_{R}(x)})}) $ matrix are added together, the resulting sequence is

palindromic, so their reverses are equal to themselves.

In the $ \phi_1(\mathfrak{H_4}^{+1}{({U_{R}(x)})}) $ matrix, the

sequence obtained when the first row and the fifth row are added together and the

sequence obtained by summing the fourth row and the fifth rows is the reverse of each other. At the same time, the

sequence is obtained when the second row and the fifth row are added together and the

sequence is obtained when the third row and the fifth row are summed and are the reverse of each other. When it is multiplied by any $ \mathfrak{q}\in\mathbb{Z}_4^* $ and the same combinations are performed, it is seen that the rows are reversed to each other.

5.   Conclusions

First, the basic notations are given by reference to the ring structure. Then, all nonobvious automorphisms over $ T_3 $ are identified and included in the basic definition and theorems related to the skew polynomial ring. The algebraic structure of the $ \theta_i $-cyclic codes of odd length was analyzed using the decomposition method, and the generator polynomial is determined. In addition, an isomorphism between $ \theta_i $-cyclic codes and $ (\theta_i, \lambda) $-constacyclic codes is established to obtain the generator polynomial of the $ (\theta_i, \lambda) $-constacyclic codes. Using this isomorphism, the generator polynomial of $ \theta_i $-cyclic codes was obtained. Under the described automorphism $ \theta_1 $, for each unit over the ring $ T_3 $, $ \mathbb{Z}_{4} $-images of the $ (\theta_i, \lambda) $-constacyclic codes have been analyzed and significant results have been obtained. Using MAGMA, new and optimal codes have been found and presented in tables. In addition, some basic definitions and theorems about the DNA codes have been included. Through the $ \phi_1 $ Gray map, a relationship between the elements of $ T_3 $ and the DNA $ 2 $-mers has been established. By defining a unit reverse polynomial, a new generation method has been built. To enhance comprehensibility, supporting examples are provided.

Author contributions

Fatma Zehra UZEKMEK: Conceptualization, formal analysis, investigation, methodology, project administration, validation, visualization, writing-original draft, writing-review-editing; Elif Segah ÖZTAS: Conceptualization, methodology, project administration, software, supervision, validation, visualization, writing-original draft, writing-review-editing; Mehmet ÖZEN: Conceptualization, methodology, project administration, supervision, validation. All authors have read and agreed to the published version of the manuscript.

Conflict of interest

All authors declare no conflicts of interest in this paper.