Related papers: Reversible cyclic codes over $\mathbb{F}_q + u \ma…
In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length $n$ over a finite field $\mathbb F_q$, in the case which each prime divisor of $n$ is also a divisor of $q-1$.
In this paper, we investigate $\theta$-skew cyclic codes over the ring $R= \mathbb{F}_4 + v \mathbb{F}_4$, where $v^2=v$ and $\theta$ is a non-trivial automorphism over $\mathbb{F}_4 + v \mathbb{F}_4$. This allows us to describe DNA code…
We introduce an altered version of the four circulant construction over group rings for self-dual codes. We consider this construction over the binary field, the rings F_2 + uF_2 and F_4 + uF_4; using groups of order 3, 7, 9, 13, and 15.…
Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s)$ and $\Gamma(\texttt{R})$ the Teichm\"uller's set of $\texttt{R}.$ In this paper, the trace representation cyclic $\texttt{R}$-linear codes of length $\ell,$ is…
In this work, four circulant and quadratic double circulant (QDC) constructions are applied to the family of the rings R_k,m. Self-dual binary codes are obtained as the Gray images of self-dual QDC codes over R_k,m. Extremal binary…
Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…
Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…
Long quasi-cyclic codes of any fixed index $>1$ have been shown to be asymptotically good, depending on Artin primitive root conjecture in (A. Alahmadi, C. G\"uneri, H. Shoaib, P. Sol\'e, 2017). We use this recent result to construct good…
Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes with length being the product of two primes. In this paper, we study the cyclic codes of length $n=2^e$ and dimension $k=2^{e-1}$. Clearly, Ding's construction is not…
For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some…
Let $\mathcal{R}=\mathbb{F}_{p^m}[u]/\langle u^3 \rangle $ be the finite commutative chain ring with unity, where $p$ is a prime, $m$ is a positive integer and $\mathbb{F}_{p^m}$ is the finite field with $p^m$ elements. In this paper, we…
In this paper, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and de- coding algorithm for these codes is given.
The interrelation between the cyclic structure of an ideal, i.e., a cyclic code over Galois field $GF(q)$, $q>2$, and its classes of proportional elements is considered. This relation is used in order to define the code's weight structure.…
In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of codes is constructed using a non-commutative ring called the skew polynomial rings $F[x;\theta ]$. After a brief description of the skew…
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.
This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…
This paper gives new methods of constructing {\it symmetric self-dual codes} over a finite field $GF(q)$ where $q$ is a power of an odd prime. These methods are motivated by the well-known Pless symmetry codes and quadratic double circulant…
We first define a new Gray map from $R=\mathbb{Z}_4+u\mathbb{Z}_4$ to $\mathbb{Z}^{2}_{4}$, where $u^2=1$ and study $(1+2u)$-constacyclic codes over $R$. Also of interest are some properties of $(1+2u)$-constacyclic codes over $R$.…
In this paper, we give a new method for constructing LCD codes. We employ group rings and a well known map that sends group ring elements to a subring of the $n \times n$ matrices to obtain LCD codes. Our construction method guarantees that…
The results of J. F. Qiann et al. [4] on $(1-\gamma)$-cyclic codes over finite chain rings of nilpotency index 2 are extended to $(1-\gamma^e)$-cyclic codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map is…