Related papers: Some Repeated-Root Constacyclic Codes over Galois …

In this note, we study skew cyclic and skew constacyclic codes over the ring $\mathcal{R}=F_{q}+uF_{q}+vF_{q}+uvF_{q}$ where $q=p^{m},$ $p$ is an odd prime, $u^{2}=u,~v^{2}=v,~uv=vu$. We show that Gray images of a skew cyclic and skew…

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

Let $m\geq 2$ be any natural number and let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+\cdots+u^{m-1}\mathbb{F}_{p}$ be a finite non-chain ring, where $u^m=u$ and $p$ is a prime congruent to $1$ modulo $(m-1)$. In this…

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual…

In this paper, necessary and sufficient conditions for a cyclic code of arbitrary length over the non-chain rings $Z_{4}+\nu Z_{4}$ for $\nu^{2} \in \{0,1,\nu,2\nu,3\nu,2+\nu,2+3\nu,3+2\nu\}$ to be a reversible cyclic code have been…

Let $\mathbb{F}_{2^m}$ be a finite field of characteristic $2$ and $R=\mathbb{F}_{2^m}[u]/\langle u^k\rangle=\mathbb{F}_{2^m} +u\mathbb{F}_{2^m}+\ldots+u^{k-1}\mathbb{F}_{2^m}$ ($u^k=0$) where $k\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For…

We study the structure of linear codes over the ring $B_k$ which is defined by $\mathbb{F}_{p^r}[v_1,v_2,\ldots,v_k]/\langle v_i^2=v_i,~v_iv_j=v_jv_i \rangle_{i,j=1}^k.$ In order to study the codes, we begin with studying the structure of…

Let $D_{2n}=\langle x,y\mid x^n=1, y^2=1, yxy=x^{-1}\rangle$ be a dihedral group, and $R={\rm GR}(p^2,m)$ be a Galois ring of characteristic $p^2$ and cardinality $p^{2m}$ where $p$ is a prime. Left ideals of the group ring $R[D_{2n}]$ are…

In this paper, we mainly study the some structure of cyclic DNA codes of odd length over the ring $R = \F_2[u,v]/\langle u^2-1,v^3-v,uv-vu \rangle$ which play an important role in DNA computing. We established a direct link between the…

We discuss the structure of negacyclic codes of odd length over the ring $\mathbb{F}_p[u, v]/ \langle u^2, v^2, uv-vu \rangle$. We find the unique generating set, the rank and the minimum distance for these negacyclic codes.

In this paper, we introduce generalized extended Hamming codes over Galois rings $GR(2^n,m)$ of characteristic $2^n$ with extension degree $m$. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over…

In this paper, we study skew constacyclic codes over the ring $\mathbb{Z}_{q}R$ where $R=\mathbb{Z}_{q}+u\mathbb{Z}_{q}$, $q=p^{s}$ for a prime $p$ and $u^{2}=0$. We give the definition of these codes as subsets of the ring…

In this paper, we shall study k-Galois LCD constacyclic group codes over finite commutative chain rings with identity. In particular, we shall characterize Galois LCD constacyclic codes over finite commutative chain ring with identity in…

In this paper, we investigate cyclic codes over the ring $ \mathbb{F}_p[u,v,w]\langle u^2,$ $v^2, w^2$, $uv-vu, vw-wv, uw-wu \rangle$, where $p$ is a prime number. Which is a part of family of Frobenius rings. We find a unique set of…

Let $\mathcal A$ the affine algebra given by the ring $\mathbb{F}_q[X_1,X_2,\ldots,X_\ell]/ I$, where $I$ is the ideal $\langle t_1(X_1), t_2(X_2), \ldots, t_\ell(X_\ell) \rangle$ with each $t_i(X_i)$, $1\leq i\leq \ell$, being a…

For any prime number $p$, positive integers $m, k, n$ satisfying ${\rm gcd}(p,n)=1$ and $\lambda_0\in \mathbb{F}_{p^m}^\times$, we prove that any $\lambda_0^{p^k}$-constacyclic code of length $p^kn$ over the finite field $\mathbb{F}_{p^m}$…

In this work, we study the structure of cyclic DNA codes of arbitrary lengths over the ring R=F2+uF2+vF2+uvF2 and establish relations to codes over R1=F2+uF2 by defining a Gray map between R and R1^2 where R1 is the ring with 4 elements.…

Maximum distance separable (MDS) codes are optimal in the sense that the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are generalized Reed-Solomon (GRS) codes. The square…

Let $\mathbb{Z}_4$ denote the ring of integers modulo $4$. The Galois ring GR$(4,m)$, which consists of $4^m$ elements, represents the Galois extension of degree $m$ over $\mathbb{Z}_4$. The constructions of codes over $\mathbb{Z}_4$ have…

The rings $Z_{4}+\nu Z_{4}$ have been classified into chain rings and non-chain rings on the basis of the values of $\nu^{2} \in Z_{4}+\nu Z_{4}.$ In this paper, the structure of cyclic codes of arbitrary length over the rings $Z_{4}+\nu…