Related papers: Repeated-root constacyclic codes over the finite c…
Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as…
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Cyclic codes have been studied for many years, but their weight…
In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal…
Let $p$ be a prime integer, $n,s\geq 2$ be integers satisfying ${\rm gcd}(p,n)=1$, and denote $R=\mathbb{Z}_{p^s}[v]/\langle v^2-pv\rangle$. Then $R$ is a local non-principal ideal ring of $p^{2s}$ elements. First, the structure of any…
This note presents an encoding and a decoding algorithms for a forest of (labelled) rooted uniform hypertrees and hypercycles in linear time, by using as few as $n - 2$ integers in the range $[1,n]$. It is a simple extension of the…
In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to…
A method to construct and count all the linear codes (of arbitrary length) in $\mathbb{F}_{4}$ that are invariant under reverse permutation and that contain the repetition code is presented. These codes are suitable for constructing DNA…
For any positive integer $m$ and an odd prime $p$; let $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $q=p^{m}$, be a ring extension of the ring $\mathbb{F}_{p}+u\mathbb{F}_{p}.$ In this paper, we construct linear codes over…
Let $\mathbb{F}_q$ be a finite field of order $q$ and integer $n\ge 1$. Let $\ell$ be a prime such that $\ell^k|(q-1)$ for some integer $k\ge 1$ and $\mu$ be an element of order $\ell^k$ in $\mathbb{F}_q$. In this paper, we determine the…
In this paper, we shall give an explicit proof that constacyclic codes over finite commutative rings can be realized as ideals in some twisted group rings. Also, we shall study isometries between those codes and, finally, we shall study…
In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…
In this article, we investigate properties of cyclic codes over a finite non-chain ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,$ where $q=p^r,$ $r$ is a positive integer, $p$ is an odd prime, $4 \mid…
For a prime $p$ and a positive integer $m$, let $\mathbb{F}_{p^m}$ be the finite field of characteristic $p$, and $\mathfrak{R}_l:=\mathbb{F}_{p^m}[v]/\langle v^l-v\rangle$ be a non-chain ring. In this paper, we study the…
The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…
This paper establishes a novel upper bound-termed the arithmetic Singleton bound-on the Hamming distance of any simple-root constacyclic code over a finite field. The key technical ingredient is the notion of multiple equal-difference (MED)…
Let $p$ be a prime number. In this paper, we study cyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes.…
This paper provides a comprehensive analysis of almost maximum distance separable (AMDS) constacyclic codes of length $4p^{\varsigma}$ over the finite field $\mathbb{F}_{p^m}$, where $p$ is an odd prime number. Furthermore, it introduces…
We determine the asymptotic proportion of free modules over finite chain rings with good distance properties and treat the asymptotics in the code length n and the residue field size q separately. We then specialize and apply our technique…
Let $\mathbb{F}_q$ be a finite field of $q=p^m$ elements where $p$ is a prime and $m$ is a positive integer. This paper considers $(\gamma,\Delta)$-cyclic codes over a class of finite non-chain commutative rings…
In this paper, we study cyclic codes over the ring $ \Z_p + u\Z_p +...+ u^{k-1}\Z_p $, where $u^k =0$. We find a set of generator for these codes. We also study the rank, the dual and the Hamming distance of these codes.