An intuitionistic fuzzy entropy-based gained and lost dominance score decision-making method to select and assess sustainable supplier selection

1.   Introduction

Error-correcting codes have been a widely studied topic for the past six decades. Among all linear codes, cyclic codes have received significant attention. Boucher et al. ^[9] generalized the concept of cyclic codes over finite fields to skew cyclic codes. Siap et al. ^[25] extended their results to skew cyclic codes of arbitrary length. For the last twenty years, scholars have focused on error-correcting codes over finite rings.

There exist a host of studies on skew cyclic codes and double skew cyclic codes over finite commutative rings. Boucher et al. ^[10] and Jitman et al. ^[17] considered skew constacyclic codes over Galois rings and finite chain rings, respectively. Abualrub et al. ^[1] built $\theta$-cyclic codes over $\mathbb{F}_{2}+v\mathbb{F}_{2}$. Gao ^[13] investigated the algebraic structure of skew cyclic codes over $\mathbb{F}_{p}+v\mathbb{F}_{p}$. Gursoy et al. ^[15] accomplished the construction of skew cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}$. The algebraic properties of skew cyclic codes over the finite semi-local ring $\mathbb{F}_{p^{m}}+v\mathbb{F}_{p^{m}}$ were studied by M. Ashraf ^[3]. Shi et al. ^[22,23] established skew cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$ and $\mathbb{F}_{q}+v\mathbb{F}_{q}+\cdots +v^{m-1}\mathbb{F}_{q}$. Bagheri et al. ^[6] studied skew cyclic codes of length $p^{s}$ over $\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$ and obtained some torsion codes of skew cyclic codes. Shi et al. ^[24] proved the structure of skew cyclic codes over a finite non-chain ring. Recently, Prakash ^[21] studied the structure of skew cyclic codes over $\mathbb{F}_{q}[u, v, w]/\langle u^{2}-1, v^{2}-1, w^{2}-1, uv-vu, vw-wv, wu-uw \rangle$. Gao et al. ^[14] studied weight distribution of double cyclic codes over Galois rings. Aydogdu et al. ^[4] characterized the algebraic structure of double skew cyclic codes over $\mathbb{F}_{q}$.

Since Wood ^[26] proved that the finite Frobenius rings can serve as the alphabets of coding theory, many papers on cyclic codes over matrix rings have been published (see ^{[2,7,11,16,18,19,20]}). However, there are few papers investigating skew and double skew cyclic codes over matrix rings. In this study, we use the $\mathbb{F}_{4}$-cyclic algebra given in ^[5] to build the algebraic structure of skew cyclic codes over $M_{2}(\mathbb{F}_{2})$. Additionally, we discuss the dual codes of skew cyclic codes and double skew cyclic codes over $M_{2}(\mathbb{F}_{2})$.

This article is organized as follows: Section 2 provides some basic facts, and considers the algebraic structure of skew cyclic codes over $M_{2}(\mathbb{F}_{2})$. We prove that a skew cyclic code $\mathcal{C}$ with a polynomial of minimum degree $d(x)$ is a free submodule generated by $d(x)$. We discuss Euclidean and Hermitian dual codes of $\theta$-cyclic codes in Section 3. In Section 4, the spanning sets of double skew cyclic codes over $M_{2}(\mathbb{F}_{2})$ are obtained, and Section 5 concludes this paper.

2.   Skew cyclic codes over $\mathcal{R}$

Let $R$ be a finite ring with identity $1\neq 0$. A left (resp. right) $R$-module $M$ is denoted by $_{R}M$ (resp. $M_{R}$). The socle of a module $M$ is defined as the sum of its minimal submodules, denoted by $\mathrm{Soc}(M)$. The ring $R$ is called a Frobenius ring if $\mathrm{Soc}(_{R}R)$ (resp. $\mathrm{Soc}(R_{R})$) is a principal left (resp. right) ideal. The ring $R$ is called a local ring if $R$ has a unique left (resp. right) maximal ideal (or equivalently, if $R/\mathrm{rad}(R)$ is a division ring). A ring $R$ is called a left (resp. right) chain ring if the set of all left (resp. right) ideals of $R$ is linearly ordered under the set inclusion. Lemma 2.1 describes the equivalence conditions between chain rings, principal ideal rings and local rings (cf. [12,Theorem 2.1]).

Lemma 2.1. For any finite ring $R$, the following conditions are equivalent:

(i) $R$ is a local principal ideal ring;

(ii) $R$ is a local ring and the unique maximal ideal $M$ of $R$ is principal;

(iii) $R$ is a chain ring whose ideal are $\langle r^{i} \rangle$, $0 \leq i \leq N(r)$, where $N(r)$ is the nilpotency index of $r$.

Moreover, if $R$ is a finite chain ring with the unique maximal ideal $\langle r \rangle$ and the nilpotency index of $r$ is $z$, then the cardinality of $\langle r^{i} \rangle$ is $\vert R/\langle r \rangle \vert ^{z-i}$ for $i = 0, 1, \cdots, z-1$.

We denote the $2\times 2$ matrix ring over finite field $\mathbb{F}_{2}$ by $M_{2}(\mathbb{F}_{2})$. By ^[5], we have $M_{2}(\mathbb{F}_{2})$ is isomorphic to the $\mathbb{F}_{4}$-cyclic algebra $\mathcal{R} = \mathbb{F}_{4} \oplus e\mathbb{F}_{4}$ with $e^{2} = 1$ under the map $\delta$,

where $\mathbb{F}_{4} = \mathbb{F}_{2}[\omega]$ and $\omega^{2} + \omega + 1 = 0$. Note that $(e+1)^2 = 0$, then $e+1$ is a nilpotent element of order 2. The multiplication in $\mathcal{R}$ is given by $re = e\sigma(r)$ for any $r\in \mathcal{R}$, where $\sigma(r) = r^{2}$ is the Frobenius map on $\mathbb{F}_{4}$ and the addition is usual.

The set of the unit elements of $\mathcal{R}$ is $\{1, \omega, 1+\omega, e, e\omega, e(1+\omega)\}$. It is easy to know that the ring $\mathcal{R}$ has the unique maximal ideal $\langle e + 1 \rangle$. Since the $n \times n$ matrix ring $M_{n}(R)$ over a Frobenius ring $R$ is also Frobenius, then $\mathcal{R}$ is a finite local Frobenius ring.

Define a map $\theta: \mathcal{R} \rightarrow \mathcal{R}$ by $\theta(a+eb) = \sigma(a)+e\sigma(b)$, $a, b \in \mathbb{F}_{4}$. One can verify that $\theta$ is an automorphism of $\mathcal{R}$ with order 2. The set $\mathbb{F}_{4, \theta} = \{0, 1, e, 1+e\}$ is the fixed commutative subring of $\mathcal{R}$ by $\theta$. Define the skew polynomial ring

with the usual polynomial addition, and the multiplication is defined by the rule $r_{1}x^{i}\cdot r_{2}x^{j} = r_{1}\theta^{i}(r_{2})x^{i+j}$, $i, j\in \mathbb{N}$. Then for every $a+eb \in \mathcal{R}$,

Note that $\mathcal{R}[x, \theta]$ is non-commutative for multiplication, therefore, the submodules we discussed in this paper are always left. It should be noted also that $\mathcal{R}[x, \theta]$ is not a unique factorization ring, for instance, $x^{2} = x\cdot x = ex\cdot ex$, $x^{3} = x\cdot x\cdot x = x\cdot ex \cdot ex$. In addition, the right division can be defined.

Lemma 2.2. Let $f(x)$, $g(x)\in \mathcal{R}[x, \theta]$, where the leading coefficient of $g(x)$ is invertible. Then there exist unique $q(x)$, $r(x)\in \mathcal{R}[x, \theta]$ such that

where $r(x) = 0$ or $\mathrm{deg}(r(x)) < \mathrm{deg}(g(x))$. The polynomials $q(x)$ and $r(x)$ are called the right quotient and right remainder, respectively. The polynomial $g(x)$ is called a right divisor of $f(x)$ if $g(x)|f(x)$.

Proof. The proof is similar to that of Lemma 2.3 of ^[13]. □

Proposition 2.3. The center $Z(\mathcal{R}[x, \theta])$ of $\mathcal{R}[x, \theta]$ is $\mathbb{F}_{4, \theta}[x^{2}]$.

Proof. This proof is similar to that of [13,Theorem 1]. We give the proof briefly. Since $|\langle \theta \rangle| = 2$, then $x^{2i}\cdot r = (\theta^{2})^{i}(r)x^{2i} = r x^{2i}$ with any $r\in \mathcal{R}$. Thus $x^{2i}\in Z(\mathcal{R}[x, \theta])$. It implies that $f(x) = \sum_{j = 0}^{s} r_{j}x^{2j}\in Z(\mathcal{R}[x, \theta])$, where $r_{j}\in \mathbb{F}_{4, \theta}$. Conversely, for any $f_{z}\in Z(\mathcal{R}[x, \theta])$ and $r\in \mathcal{R}$, if $rf_{z} = f_{z}r$ and $xf_{z} = f_{z}x$, then the coefficients of $f_{z}$ are all in $\mathbb{F}_{4, \theta}$ and $f_{z}\in \mathcal{R}[x^{2}, \theta]$. Therefore $f_{z}\in \mathbb{F}_{4, \theta}[x^{2}]$. □

Corollary 2.4. We have that $x^{n}+1 \in Z(\mathcal{R}[x, \theta])$ if and only if $n$ is even.

Let $\mathcal{R}^{n}$ be the set of all $n$-tuples over $\mathcal{R}$. Then a code $\mathcal{C}$ of length $n$ over $\mathcal{R}$ is a nonempty subset of $\mathcal{R}^{n}$. If $\mathcal{C}$ is a left (resp. right) $\mathcal{R}$-submodule of $\mathcal{R}^{n}$, then $\mathcal{C}$ is called a left (resp. right) linear code of length $n$ over $\mathcal{R}$. Every element $c = (c_{0}, c_{1}, \cdots, c_{n-1})$ in $\mathcal{C}$ is called a codeword.

Define the Gray map $\varphi(a+eb) = (b, a+b)$ from $\mathcal{R}$ to $\mathbb{F}_{4}^{2}$ following the method in ^[8]. This map $\varphi$ is a linear bijection and can be extended to a map from $\mathcal{R}^n$ onto $\mathbb{F}_{4}^{2n}$ by concatenating the images of each component. For any element $a+eb\in \mathcal{R}$, Lee weight of $a+eb$ is defined as

where $w_{Ham}(*)$ stands for Hamming weight over finite fields. If $x = (x_{0}, x_{1}, \cdots, x_{n-1})\in \mathcal{R}^{n}$, then Lee weight of $x$ is defined as

If $\mathcal{C}$ is a linear code of length $n$ over $\mathcal{R}$, then Hamming and Lee distance of $\mathcal{C}$ are defined as $d_{Ham} = \mathrm{min}\{w_{Ham}(\mathrm{x})|\mathrm{x}\in \mathcal{C}\}$ and $d_{L} = \mathrm{min}\{w_{L}(\mathrm{x})|\mathrm{x}\in \mathcal{C}\}$, respectively. Analogously to [19,Theorem 7], we get the following result. It is a proposition of the image of the linear code $\mathcal{C}$ over $\mathcal{R}$ under the Gray map $\varphi$.

Proposition 2.5. Let $\mathcal{C}$ be a linear code over $\mathcal{R}$ of length $n$ with size $\mathcal{M}$ and minimum Lee distance $d_{L}$. Then $\varphi(\mathcal{C})$ is a linear code over $\mathbb{F}_{4}$ of length $2n$ with size $\mathcal{M}$ and minimum Hamming distance $d_{Ham}$.

We discuss the algebraic structure of skew cyclic codes over $\mathcal{R}$ below. Let $n$ be a positive integer. The set $\mathcal{R}_{n} = \mathcal{R}[x, \theta] / \langle x^{n}-1 \rangle$ is a ring if $n$ is even. When $n$ is odd, the set $\mathcal{R}_{n}$ is a left $\mathcal{R}[x, \theta]$-module under the multiplication defined by

Denote by $\mathscr{T}$ the standard shift operator on a linear code $\mathcal{C}$, i.e., $\mathscr{T}(c) = (c_{n-1}, c_{0}, \cdots, c_{n-2})$ for any codeword $c = (c_{0}, c_{1}, \cdots, c_{n-1})\in \mathcal{C}$. A linear code $\mathcal{C}$ over $\mathcal{R}$ is cyclic if any cyclic shift of a codeword $c\in \mathcal{C}$ is also a codeword, i.e., $\mathscr{T}(c)\in \mathcal{C}$. A linear code over $\mathcal{R}$ is called quasi-cyclic of index $\ell$ (or $\ell$-quasi-cyclic) if and only if it is invariant under $\mathscr{T}^{\ell}$. If $\ell = 1$, then it is a cyclic code. A linear code $\mathcal{C}$ of length $n$ is called a skew cyclic code if and only if

for any codeword $c = (c_{0}, c_{1}, \cdots, c_{n-1})\in \mathcal{C}$.

In a set of polynomials, a polynomial is called the polynomial of minimum degree if and only if it is not a polynomial of lower degree by removing any of its terms. Let $d(x) = x^{n-m} + \sum_{i = 0}^{n-m-1}d_{i}x^{i}$ be a monic right divisor of $x^{n}-1$. Then a $m \times n$ generator matrix $G$ of the skew cyclic code $\mathcal{C} = \langle d(x) \rangle$ is given by

Proposition 2.6 shows that skew cyclic codes with a polynomial of minimum degree over $\mathcal{R}$ are free codes. Proposition 2.9 gives a sufficient and necessary condition for a skew cyclic code over $\mathcal{R}$ to become a cyclic code. Propositions 2.7 and 2.8 describe the relationship between skew cyclic codes of length $n$ and cyclic codes, quasi-cyclic codes, respectively.

Proposition 2.6. Let $n$ be a positive integer and $\mathcal{C}$ be a skew cyclic code of length $n$ over $\mathcal{R}$ with a polynomial of minimum degree $d(x)$, where the leading coefficient of $d(x)$ is a unit. Then $\mathcal{C}$ is a free $\mathcal{R}[x, \theta]$-submodule of $\mathcal{R}_{n}$ such that $\mathcal{C} = \langle d(x) \rangle$, where $d(x)$ is a right divisor of $x^{n}-1$. Moreover, the code $\mathcal{C}$ has a basis $\mathcal{B} = \{ d(x), xd(x), \cdots, x^{n-\mathrm{deg}(d(x))-1}d(x)\}$ and the number of codewords in $\mathcal{C}$ is $\lvert{\mathcal{R}}\rvert^{n-\mathrm{deg}(d(x))}$.

Proof. By Lemma 2.2, any polynomial in $\mathcal{C}$ is divisible by $d(x)$. It implies that $d(x) \vert x^{n}-1$ and $\mathcal{C} = \langle d(x) \rangle$. For the second statement, let $x^{n}-1 = q(x)d(x)$ for some $q(x)\in \mathcal{R}[x, \theta]$. Since the leading coefficient of $d(x)$ is a unit, then the leading coefficient of $q(x)$ is also invertible. Let $m$ be the degree of $q(x)$, then the degree of $d(x)$ is $n-m$. Let $q(x) = \sum_{i = 0}^{m}q_{i}x^{i}$, where $q_{m}$ is invertible. Therefore $\sum_{i = 0}^{m}q_{i}x^{i}d(x) = 0$ in $\mathcal{R}_{n}$. It follows that $x^{j}d(x)$ with $j\geq m$ can be linearly presented by the elements of the set $\mathcal{B} = \{d(x), xd(x), \cdots, x^{m-1}d(x)\}$.

Let $\sum_{i = 0}^{m-1}a_{i}\cdot x^{i}d(x) = 0$, where $a_{i}\in \mathcal{R}$, $i = 0, 1, \cdots, m-1$. Thus $a(x)d(x) = 0$, where $a(x) = \sum_{i = 0}^{m-1} a_{i}x^{i}$. The polynomial $a(x)d(x)$ can be represented to $a(x)d(x) = \zeta(x)(x^{n}-1)$ for some $\zeta(x)\in \mathcal{R}[x, \theta]$. The degree of $a(x)d(x)$ is $n-1$, while the degree of $\zeta(x)(x^{n}-1)$ is greater than or equal to $n$ if $\zeta(x)\neq 0$. This is a contradiction. Therefore, we have $\zeta(x) = a(x) = 0$, i.e. $a_{i} = 0$ for $i = 0, 1, \cdots, m-1$. The set $\mathcal{B} = \{d(x), xd(x), \cdots, x^{m-1}d(x)\}$ is $\mathcal{R}$-linearly independent. Consequently $\mathcal{B}$ is a basis of $\mathcal{C}$ and $\vert \mathcal{C} \vert = \vert \mathcal{R} \vert ^{n-\mathrm{deg}(d(x))}$. This completes the proof. □

Proposition 2.7. If $\mathcal{C}$ is a skew cyclic code of odd length over $\mathcal{R}$, then $\mathcal{C}$ is a cyclic code over $\mathcal{R}$.

Proof. Let $n$ be odd and $\mathcal{C}$ be a skew cyclic code of length $n$ over $\mathcal{R}$. There exist two integers $s, t$ such that $2s + nt = 1$. Thus, we have $2s = 1 - nt$. If $c(x) = \sum_{i = 0}^{n-1} c_{i}x^{i}$ is any codeword in $\mathcal{C}$, then

Since $x^{n} = 1$, then

It follows that $(c_{n-1}, c_{0}, \cdots, c_{n-2})\in \mathcal{C}$ for any codeword $(c_{0}, c_{1}, \cdots, c_{n-1})$ in $\mathcal{C}$. □

Proposition 2.8. If $\mathcal{C}$ is a skew cyclic code of even length over $\mathcal{R}$, then $\mathcal{C}$ is a quasi-cyclic code of index 2.

Proof. Let $\mathcal{C}$ be a skew cyclic code of length $2t$ over $\mathcal{R}$ and $c = (c_{0, 0}, c_{0, 1}, c_{1, 0}, \cdots, c_{t-1, 0}, c_{t-1, 1}) \in \mathcal{C}$. Since $\theta(c)\in \mathcal{C}$ and $\theta^{2} = 1$, it follows that $\theta^{2}(c) = (c_{t-1, 0}, c_{t-1, 1}, c_{0, 0}, c_{0, 1}, \cdots, c_{t-2, 0}, c_{t-2, 1})\in \mathcal{C}$. By the definition of quasi-cyclic codes, the code $\mathcal{C}$ is a $2$-quasi-cyclic code of length $2t$. □

Proposition 2.9. Let $\mathcal{C}$ be a skew cyclic code generated by $d(x)$ of even length $n$ over $\mathcal{R}$, where $d(x)$ is a monic right divisor of $x^{n}-1$. Then $\mathcal{C}$ is a cyclic code over $\mathcal{R}$ if and only if $d(x)$ is fixed by $\theta$.

Proof. Let $d(x) = x^{l} + d_{l-1}x^{l-1} + \cdots + d_{1}x + d_{0}$, where $\theta(d_{i}) = d_{i}$, $i = 0, 1, 2, \cdots, l-1$. Then $xd(x) = d(x)x\in \mathcal{C}$. It follows that the code $\mathcal{C} = \langle d(x) \rangle$ is cyclic over $\mathcal{R}$.

Conversely, if $\mathcal{C}$ is a cyclic code of even length $n$ over $\mathcal{R}$, then $\mathcal{C}$ is a left ideal of $\mathcal{R}_{n}$ and an ideal of $\mathcal{R}[x]/\langle x^{n}-1 \rangle$. Therefore, $d(x)x$ is a codeword in $\mathcal{C}$. Since $\mathcal{C}$ is linear, we have $d(x)x - xd(x) \in \mathcal{C}$. It implies that $\sum_{i = 0}^{l-1} (d_{i} - \theta(d_{i}))x^{i+1}$ is a left multiple of $d(x)$ such that $d(x)x - xd(x) = rd(x)$ with $r\in \mathcal{R}$. Note that the constant term of $d(x)x - xd(x)$ is $0$, then $d(x)x - xd(x)$ must be $0$. It shows that $\theta(d_{i}) = d_{i}$, $i = 0, 1, \cdots, l-1$. The proof is done. □

Example 2.10. There are two examples:

(1) Let $\mathcal{C}$ be a skew cyclic code of length $4$ over $\mathcal{R}$ generated by the following matrix,

The generated polynomial of $\mathcal{C}$ is $d(x) = x^{2}+(e+1)x+e$. Note that $d(x)$ is a commutative right divisor of $x^{4}-1$, and all coefficients of $d(x)$ are fixed by $\theta$. By Proposition 2.9, the code $\mathcal{C}$ is cyclic.

(2) Let $\mathcal{C}_{1}$ be a skew cyclic code of length $4$ generated by the following matrix,

The generated polynomial of $\mathcal{C}_{1}$ is $d_{1}(x) = x+\omega$, and it is a right divisor of $x^{4}-1$. The coefficients of $d_{1}(x)$ are not all fixed by $\theta$. By Propositions 2.8 and 2.9, the code $\mathcal{C}_{1}$ is not cyclic but 2-quasi-cyclic.

3.   Duals of skew cyclic codes over $\mathcal{R}$

This section investigates the dual codes of skew cyclic codes over the ring $\mathcal{R}$. For any $\mathit{\boldsymbol{\mathrm{x}}} = (x_{0}, x_{1}, \cdots, x_{n-1})$ and $\mathit{\boldsymbol{\mathrm{y}}} = (y_{0}, y_{1}, \cdots, y_{n-1}) \in \mathcal{R}^{n}$, the Euclidean inner product on $\mathcal{R}^{n}$ is defined by $\langle \mathit{\boldsymbol{\mathrm{x}}}, \mathit{\boldsymbol{\mathrm{y}}} \rangle = \sum_{i = 0}^{n-1}x_{i}y_{i}$. If the order of the automorphism $\theta$ is 2, then the Hermitian inner product of any $\mathit{\boldsymbol{\mathrm{x}}}, \mathit{\boldsymbol{\mathrm{y}}}\in \mathcal{R}^{n}$ is defined by ${\langle \mathit{\boldsymbol{\mathrm{x}}}, \mathit{\boldsymbol{\mathrm{y}}} \rangle}_{H} = \sum_{i = 0}^{n-1} x_{i}\theta(y_{i})$.

The elements $\mathit{\boldsymbol{\mathrm{x}}}, \mathit{\boldsymbol{\mathrm{y}}}\in \mathcal{R}^{n}$ are called Euclidean or Hermitian orthogonal if $\langle \mathit{\boldsymbol{\mathrm{x}}}, \mathit{\boldsymbol{\mathrm{y}}} \rangle = 0$ or ${\langle \mathit{\boldsymbol{\mathrm{x}}}, \mathit{\boldsymbol{\mathrm{y}}} \rangle}_{H} = 0$, respectively. Let $\mathcal{C}$ be a skew cyclic code over $\mathcal{R}$. Then its Euclidean dual code $\mathcal{C}^{\bot}$ is defined as $\mathcal{C}^{\bot} = \{\mathit{\boldsymbol{\mathrm{y}}}\in \mathcal{R}^{n} \vert \langle \mathit{\boldsymbol{\mathrm{y}}}, \mathit{\boldsymbol{\mathrm{x}}}\rangle = 0 \mbox{ for all $\mathit{\boldsymbol{\mathrm{x}}}\in \mathcal{C}$ }\}$. The Hermitian dual code $\mathcal{C}^{\bot}_{H}$ of $\mathcal{C}$ is defined as $\mathcal{C}^{\bot}_{H} = \{\mathit{\boldsymbol{\mathrm{z}}}\in \mathcal{R}^{n} \vert \langle \mathit{\boldsymbol{\mathrm{z}}}, \mathit{\boldsymbol{\mathrm{x}}} \rangle_{H} = 0 \mbox{ for all $\mathit{\boldsymbol{\mathrm{x}}}\in \mathcal{C}$ }\}$. A code $\mathcal{C}$ is called Euclidean or Hermitian self-dual if $\mathcal{C} = \mathcal{C}^{\bot}$ or $\mathcal{C} = \mathcal{C}_{H}^{\bot}$, respectively.

Jitman et al. ^[17] described the algebraic structure of skew constacyclic codes over finite chain rings, and provided the generators of Euclidean and Hermitian dual codes of such codes. The ring $\mathcal{R} = \mathbb{F}_{4}\oplus e\mathbb{F}_{4}$ can be alternatively represented as $\mathbb{F}_{4}\oplus u\mathbb{F}_{4}$ with $u^{2} = (e+1)^{2} = 0$. This indicates that $\mathcal{R}$ is a finite chain ring under the change of basis.

In this section, Proposition 3.2 delineates a sufficient and necessary condition for Hermitian dual code of a skew cyclic code with length $n$ over $\mathcal{R}$. Proposition 3.3 is the self-dual skew condition of Hermitian dual code. Propositions 3.2 and 3.3 can be seen as corollaries of Theorems 3.7 and 3.8 of ^[17], respectively. The main work of this section is to depict the structure of Euclidean dual codes of skew cyclic codes over $\mathcal{R}$. Proposition 3.6 illustrates that the Euclidean dual codes of skew cyclic codes of even length generated by a monic polynomial over $\mathcal{R}$ are also free and gives their generator polynomials.

By Lemmas 3.1 and 3.5 of ^[17], we acquire the following statement.

Lemma 3.1. Let $\mathcal{C}$ be a linear code of length $n$ over $\mathcal{R}$.

(i) For any integer $n$, the code $\mathcal{C}$ is a skew cyclic code if and only if $\mathcal{C}^{\bot}$ is skew cyclic.

(ii) For even integer $n$, the code $\mathcal{C}$ is a skew cyclic code if and only if $\mathcal{C}^{\bot}_{H}$ is skew cyclic.

From ^[17], the ring automorphism $\rho$ on $\mathcal{R}[x, \theta]$ is given as

By Theorems 3.7 and 3.8 of ^[17], we have the following results.

Proposition 3.2. Let $n$ be even. If $d(x)$ is a monic right divisor of $x^{n}-1$ and $\hat{d}(x) = \frac{x^{n}-1}{d(x)}$, then $\mathcal{C}$ is a free skew cyclic code generated by $d(x)$ if and only if $\mathcal{C}_{H}^{\bot}$ is a skew cyclic code generated by

where $\phi: \mathcal{R}[x, \theta]\rightarrow \mathcal{R}[x, \theta]\mathcal{S}^{-1}$ is the anti-monomorphism of rings defined by

with $\mathcal{S} = \{x^{i}\vert i\in \mathbb{N}\}$.

Proposition 3.3. Let $n = 2k$. If $d(x) = x^{k} + \sum_{i = 0}^{k-1} d_{i}x^{i}$ is a right divisor of $x^{n}-1$, then the skew cyclic code $\mathcal{C} = \langle d(x) \rangle$ is a Hermitian self-dual code if and only if

This is called the self-dual skew condition.

Next, we discuss the algebraic properties of Euclidean dual codes of skew cyclic codes over $\mathcal{R}$.

Lemma 3.4. Let $d(x), q(x)\in \mathcal{R}[x, \theta]$, where the leading coefficient of $q(x)$ is a unit. If $d(x)q(x)\in Z(\mathcal{R}[x, \theta])$ is a monic polynomial, then $d(x)q(x) = q(x)d(x)$.

Proof. It is easy to prove by $q(x)(d(x)q(x)) = (d(x)q(x))q(x)$ and Lemma 2.2. □

Lemma 3.5. Let $n$ be even and $x^{n}-1 = q(x)d(x)$, where the leading coefficient of $q(x)$ is a unit. If $\mathcal{C} = \langle d(x) \rangle$ is a skew cyclic code of length $n$ over $\mathcal{R}$, then $c(x)\in \mathcal{R}_{n}$ is in $\mathcal{C}$ if and only if $c(x)q(x) = 0$ in $\mathcal{R}_{n}$.

Proof. Let $c(x) \in \mathcal{C}$. Then $c(x) = r(x)d(x)$ for some $r(x)\in \mathcal{R}[x, \theta]$. Since $x^{n}-1 = q(x)d(x)\in Z(\mathcal{R}[x, \theta])$, we have $q(x)d(x) = d(x)q(x)$. Hence $c(x)q(x) = r(x)d(x)q(x) = r(x)q(x)d(x) = 0$ in $\mathcal{R}_{n}$.

Conversely, if $c(x)q(x) = 0$ in $\mathcal{R}_{n}$ for some $c(x)\in \mathcal{R}[x, \theta]$, then there exists $r(x)\in \mathcal{R}[x, \theta]$ such that $c(x)q(x) = r(x)(x^{n}-1) = r(x)q(x)d(x) = r(x)d(x)q(x)$, i.e., $c(x) = r(x)d(x)\in \mathcal{C}$. □

Proposition 3.6. Let $\mathcal{C} = \langle d(x) \rangle$ be a skew cyclic code of even length $n$ over $\mathcal{R}$, where $d(x)$ is a monic right divisor of $x^{n}-1$. Let $x^{n}-1 = q(x)d(x)$, $q(x) = x^{m}+\sum_{j = 0}^{m-1}q_{j}x^{j}$ and $d(x) = x^{n-m}+\sum_{i = 0}^{n-m-1}d_{i}x^{i}$. Then $\mathcal{C}^{\bot}$ is generated by the polynomial $q^{*}(x) = 1+\sum_{i = 0}^{m} \theta^{i}(q_{m-i})x^{i}$.

Proof. Let $c(x) = \sum_{i = 0}^{n-1}c_{i}x^{i}$ be a codeword in $\mathcal{C}$. Then $c(x)q(x) = 0$ in $\mathcal{R}_{n}$ by Lemma 3.5. The coefficients of $x^{m}, x^{m+1}, \cdots, x^{n-1}$ are all zeros in $c(x)q(x)$. Therefore, we have

We set

It is easy to know that each row vector of $Q^{*}$ is orthogonal to every codeword in $\mathcal{C}$. Thus, all the row vectors of $Q^{*}$ are in $\mathcal{C}^{\bot}$. Since $\mathcal{C}$ is a Frobenius ring and $\mathrm{deg}(d(x)) = n-m$, then $|\mathcal{C}||\mathcal{C}^{\bot}| = |\mathcal{R}|^{n}$, $|\mathcal{C}| = |\mathcal{R}|^{m}$ and $|\mathcal{C}^{\bot}| = |\mathcal{R}|^{n-m}$. Note that the rows of $Q^{*}$ are linearly independent. Consequently, the cardinality of the row spanning of $Q^{*}$ is $|\mathcal{R}|^{n-m}$. It follows that $Q^{*}$ is a generator matrix of $\mathcal{C}^{\bot}$. Observe that $Q^{*}$ is a circular matrix, then the corresponding polynomial $q^{*}(x) = 1+\sum_{i = 0}^{m} \theta^{i}(q_{m-i})x^{i}$ is a generator polynomial of $\mathcal{C}^{\bot}$. The proof is done. □

Example 3.7. Let $\mathcal{C}_{1} = \langle d_{1}(x) \rangle$ be a skew cyclic code of length $4$ over $\mathcal{R}$. With the same notation as in Example 2.10, by Proposition 3.6, we have that the generated polynomial of dual code $\mathcal{C}_{1}^{\bot}$ of $\mathcal{C}_{1}$ is $q_{1}^{*}(x) = \omega x^{3} + x^{2} + \omega x$. The generated matrix of $\mathcal{C}_{1}^{\bot}$ is

4.   Double skew cyclic codes over $\mathcal{R}$

Both double cyclic codes and double skew cyclic codes are good linear codes because of their specific closure properties under the standard shift and addition operations. Double cyclic codes can be extended to double skew cyclic codes. We investigate double skew cyclic codes over $\mathcal{R}$ in this section.

A code $\mathcal{C}$ of length $n$ is called double skew linear code if any codeword in $\mathcal{C}$ is partitioned into two blocks of lengths $n_{1}$ and $n_{2}$ such that the set of the first blocks of $n_{1}$ symbols and the set of second blocks of $n_{2}$ symbols form skew linear codes of lengths $n_{1}$ and $n_{2}$ over $\mathcal{R}$, respectively.

For any $r\in \mathcal{R}$ and $c = (u_{0}, u_{1}, \cdots, u_{n_{1}-1}, v_{0}, v_{1}, \cdots, v_{n_{2}-1})\in \mathcal{R}^{n_{1}+n_{2}}$, we define

It implies that $\mathcal{R}^{n_{1}+n_{2}}$ is an $\mathcal{R}$-module under the multiplication and a double skew linear code is an $\mathcal{R}$-submodule of $\mathcal{R}^{n_{1}+n_{2}}$.

A double linear code $\mathcal{C}$ of length $n = n_{1}+n_{2}$ over $\mathcal{R}$ is called double cyclic code if

implies

A double skew linear code $\mathcal{C}$ of length $n_{1}+n_{2}$ over $\mathcal{R}$ is called a double skew cyclic code if and only if

for any codeword

We denote the codeword $c = (u_{0}, u_{1}, \cdots, u_{n_{1}-1}, v_{0}, v_{1}, \cdots, v_{n_{2}-1})\in \mathcal{C}$ by $c(x) = (c_{1}(x) \vert c_{2}(x))$, where

and

It gives a bijection between $\mathcal{R}^{n_{1}+n_{2}}$ and $\mathcal{R}_{n_{1}, n_{2}} = \mathcal{R}[x, \theta]/\langle x^{n_{1}}-1 \rangle \times \mathcal{R}[x, \theta]/\langle x^{n_{2}}-1 \rangle$. Define the multiplication of any $r(x)\in \mathcal{R}[x, \theta]$ and $(c_{1}(x) \vert c_{2}(x))\in \mathcal{R}_{n_{1}, n_{2}}$ as

Under the multiplication, we have that $\mathcal{R}_{n_{1}, n_{2}}$ is a left $\mathcal{R}[x, \theta]$-module. If $c(x) = (c_{1}(x) \vert c_{2}(x))$ is a codeword in $\mathcal{C}$, then $xc(x)$ is the standard skew cyclic shift of $c$.

Propositions 4.1 to 4.3 depict the structural properties of double skew cyclic codes of length $n_{1} + n_{2}$ over $\mathcal{R}$.

Proposition 4.1. A code $\mathcal{C}$ is a double skew cyclic code over $\mathcal{R}$ if and only if $\mathcal{C}$ is a $\mathcal{R}[x, \theta]$-submodule of $\mathcal{R}_{n_{1}, n_{2}}$.

Proof. Let $\mathcal{C}$ be a double skew cyclic code and $c = (c_{1}(x) \vert c_{2}(x))\in \mathcal{C}$. Notice that $xc(x)\in \mathcal{C}$ and $\mathcal{C}$ is linear, then $r(x)c(x)\in \mathcal{C}$ for any $r(x)\in \mathcal{R}[x, \theta]$. Therefore $\mathcal{C}$ is a left $\mathcal{R}[x, \theta]$-submodule of the left module $\mathcal{R}_{n_{1}, n_{2}}$. The converse is trivial. □

Proposition 4.2. A double skew cyclic code of length $n_{1}+n_{2}$ is a double cyclic code if $n_{1}$ and $n_{2}$ are both odd.

Proof. The proof follows by Proposition 2.7. □

Proposition 4.3. Let $x^{n_{1}}-1 = q_{1}(x)d_{1}(x)$ and $x^{n_{2}}-1 = q_{2}(x)d_{2}(x)$, where $d_{1}(x)$ and $d_{2}(x)$ are two monic polynomials. If $\mathcal{C}_{1} = \langle d_{1}(x) \rangle$ and $\mathcal{C}_{2} = \langle d_{2}(x) \rangle$ are two free skew cyclic codes of length $n_{1}$ and $n_{2}$ over $\mathcal{R}$, respectively, then the code $\mathcal{C}$ generated by $d(x) = (d_{1}(x)\vert d_{2}(x))$ is a double skew cyclic code. Furthermore, $\mathcal{A} = \{d(x), xd(x), \cdots, x^{l-1}d(x)\}$ is a spanning set of $\mathcal{C}$, where $l = \mathrm{deg}(q(x))$ and $q(x) = \mathrm{lcm}\{q_{1}(x), q_{2}(x)\} = \sum_{i = 0}^{l} q_{i}x^{i}$.

Proof. By the definition of double skew cyclic codes, it is clear that $\mathcal{C} = \langle d(x) \rangle$ is a double skew cyclic code. The first statement follows. For the second statement, since $q(x)$ is the least common multiple of $q_{1}(x)$ and $q_{2}(x)$, we have $q(x)d(x) = q(x)(d_{1}(x)|d_{2}(x)) = 0$ and $x^{j}d(x)$ with $j\geq l$ can be linearly represented by the elements of the set $\mathcal{A} = \{d(x), xd(x), \cdots, x^{l-1}d(x)\}$. Now let $c(x)\in \mathcal{C}$ be any non-zero codeword in $\mathcal{C}$. Then $c(x) = a(x)d(x)$ for some $a(x)\in \mathcal{R}[x, \theta]$. If $\mathrm{deg}(a(x))\geq l$, then $a(x) = p(x)q(x) + r(x)$ by Lemma 2.2, where $r(x) = 0$ or $\mathrm{deg}(r(x)) < \mathrm{deg}(q(x))$. It follows that $c(x) = a(x)d(x) = r(x)d(x)$. Since $r(x) = 0$ or $\mathrm{deg}(r(x)) \leq l-1$, then any non-zero codeword in $\mathcal{C}$ is a linear combination of the elements in $\mathcal{A}$. The proof is done. □

5.   Conclusions

In this paper, we examine the structure of skew cyclic codes over $M_{2}(\mathbb{F}_{2})$. All skew cyclic codes of length $n$ over $M_{2}(\mathbb{F}_{2})$ can be identified as left $\mathcal{R}[x, \theta]$-submodules of left module $\mathcal{R}_{n} = \mathcal{R}[x, \theta]/\langle x^{n}-1 \rangle$. Our results show that a skew cyclic code $\mathcal{C}$ with a polynomial of minimum degree $d(x)$ is a free submodule $\langle d(x) \rangle$. We prove that a skew cyclic code of odd or even length over $M_{2}(\mathbb{F}_{2})$ is a cyclic or $2$-quasi-cyclic code. We give the self-dual skew condition of the Hermitian dual code and the generator of Euclidean dual code of a skew cyclic code, respectively. Furthermore, a spanning set of a double skew cyclic code over $M_{2}(\mathbb{F}_{2})$ is obtained.

Use of AI tools declaration

The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

Acknowledgments

This work was supported by the Natural Science Foundation of Shandong Province, China (Grant number ZR2019BA011) and by the National Natural Science Foundation of China (Grant number 11401285).

Conflict of interest

The authors declare no conflicts of interest.