2000 character limit reached
Left Dihedral Codes over Finite Chain Rings (2105.07499v1)
Published 16 May 2021 in cs.IT, math.IT, and math.RA
Abstract: Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm gcd}(char(R),n)=1$. In this way, we explore the structure of some skew-cyclic codes of length 2 over $R$ and also over $R\times S$, where $S$ is an isomorphic copy of $R$. As a particular result, we give the structure of cyclic codes of length 2 over $R$. In the case where $R=\F_{pm}$ is a Galois field, we give a classification for left $D_{2N}$-codes over $\F_{pm}$, for any positive integer $N$. In both cases we determine dual codes and identify self-dual ones.