On the structure of cyclic codes over \(M_2(\mathbb{F}_{p}+u\mathbb{F}_{p})\) (Q2124836)

The cyclic codes over rings of matrices have attracted a growing interest among researchers. For a prime \(p\) such that \(p\equiv 2 \text{~or~} 3 \pmod 5\), this paper investigate the structure of cyclic codes over the matrix ring \(R=M_2(\mathbb{F}_p+u\mathbb{F}_p)\), where \(u^2=0\). In Section 3, by identifying cyclic codes of length \(N\) (satisfying \(\gcd(N, p)=1\)) over \(R\) as right \(R\)-submodules of \(R[x]/\langle x^N-1\rangle\), it is proved that if \(\mathcal{C}\) be a cyclic code of length \(N\), then \[ \mathcal{C}=\langle\hat{F}_{1}\rangle \oplus\langle u \hat{F}_{2}\rangle \oplus\langle v \hat{F}_{3}\rangle \oplus\langle u v \hat{F}_{4}\rangle \oplus\langle(u+v H_{f}) \hat{F}_{5}\rangle \oplus(\langle u \hat{F}_{6}\rangle+\langle v \hat{F}_{6}\rangle)\tag{1} \] and \(|\mathcal{C}|=p^{8 \operatorname{deg} F_{1}+4 \operatorname{deg} F_{2}+4 \operatorname{deg} F_{3}+2 \operatorname{deg} F_{4}+4 \operatorname{deg} F_{5}+6 \operatorname{deg} F_{6}}\), where \(F_{0}, F_{1}, \ldots, F_{6}\) are pairwise coprime and monic polynomials in \(\mathbb{F}_{p^{2}}[x]\) such that \(x^{N}-1=\prod_{s=0}^{6} F_{s}\) with \(\hat{F}_{s}=\frac{x^{N}-1}{F_{s}}\) and \(H_{f}\) is a unit in \(\mathbb{F}_{p^{2}}[x]\). And if \(\mathcal{C}\) be a cyclic code of length \(N\) over \(R\), then \(\mathcal{C}=\langle A\rangle \oplus u\langle B\rangle \oplus v\langle C\rangle \oplus u v\langle D\rangle \oplus(u+\) \(\left.v H_{f}\right)\langle F\rangle\) and \(|\mathcal{C}|=p^{10 N-2(\operatorname{deg} A+\operatorname{deg} B+\operatorname{deg} C+\operatorname{deg} D+\operatorname{deg} F)}\), where \(A, B, C, D, F\) are polynomials in \(\mathbb{F}_{p^{2}}[x]\) which are factors of \(x^{N}-1\). It is worth mentioning that the cyclic codes over \(M_2(\mathbb{F}_2+u\mathbb{F}_2)\) were studied in [\textit{R. Luo} and \textit{U. Parampalli}, Cryptogr. Commun. 10, No. 6, 1109--1117 (2018; Zbl 1419.94078)] along with the Gray map and some good parameters of linear codes over \(\mathbb{F}_4\). The authors follow and extend the work of Luo and Parampalli on the structure of cyclic codes, and some proofs are the same. In the fourth section, the authors obtain the structure of dual codes (Theorem 4), and necessary and sufficient conditions (Theorem 5) for cyclic codes to be self-dual. One of their main results says that if \(\mathcal{C}\) is a cyclic code of length \(N\), then we have its dual code \[ \mathcal{C}^{\perp}=\langle\hat{F}_{0}^{*}\rangle \oplus\langle u \hat{F}_{2}^{*}\rangle \oplus\langle v \hat{F}_{3}^{*}\rangle \oplus\langle u v \hat{F}_{6}^{*}\rangle \oplus\langle(u+v H_{f}) \hat{F}_{5}^{*}\rangle \oplus(\langle u \hat{F}_{4}^{*}\rangle+\langle v \hat{F}_{4}\rangle) \] with \(|\mathcal{C}^{\perp}|=p^{(8 \operatorname{deg} F_{0}+4 \operatorname{deg} F_{2}+4 \operatorname{deg} F_{3}+6 \operatorname{deg} F_{4}+4 \operatorname{deg} F_{5}+2 \operatorname{deg} F_{6})}\). Another main result says that such code \(\mathcal{C}\) is a self-dual cyclic code if and only if \(F_{1}=F_{0}^{*}, F_{2}=F_{2}^{*}, F_{3}=F_{3}^{*}, F_{4}=F_{6}^{*}, F_{5}=F_{5}^{*}, F_{6}=F_{4}^{*}\). Finally, several optimal and near to optimal codes over \(M_2(\mathbb{F}_2+u\mathbb{F}_2)\) and \(M_2(\mathbb{F}_3+u\mathbb{F}_3)\) are obtained.