English
Related papers

Related papers: Skew cyclic codes over $\mathbb{F}_{p}+u\mathbb{F}…

200 papers

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^2)$-constacyclic codes over the ring $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$, where $u^3=u$. We describe generator polynomials of this kind…

Information Theory · Computer Science 2015-06-25 Hojjat Mostafanasab , Negin Karimi

In this paper, we first consider the iterated skew polynomial ring $\mathscr{R}[z_1;\tau_1,\delta_{\tau_1}]$\\$[z_2;\tau_2,\delta_{\tau_2}]$, where $\mathscr{R}$ is a finite ring with unity. Then we use this structure for the construction…

Information Theory · Computer Science 2025-01-07 Shikha Patel , Om Prakash

In this paper, the investigation on the algebraic structure of the ring $\frac{\mathbb{F}_q[v]}{\langle\,v^q-v\,\rangle}$ and the description of its automorphism group, enable to study the algebraic structure of codes and their dual over…

Information Theory · Computer Science 2019-02-28 Joël Kabore , Alexandre Fotue-Tabue , Kenza Guenda , Mohammed E. Charkani

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…

Information Theory · Computer Science 2015-11-13 Sukhamoy Pattanayak , Abhay Kumar Singh , Pratyush Kumar

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

Information Theory · Computer Science 2026-05-26 Junjie Huang , Jicheng Ma , Chang-An Zhao

In the present paper we study the structure of cyclic DNA codes of even lenght over the ring $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ where $u^3=0$. We investigate two presentations of cyclic codes of even lenght over…

Information Theory · Computer Science 2016-03-21 Hojjat Mostafanasab , Ahmad Yousefian Darani

Cyclic codes, as a crucial subclass of linear codes, exhibit broad applications in communication systems, data storage systems, and consumer electronics, primarily attributed to their well-structured algebraic properties. Let $p$ denote an…

Information Theory · Computer Science 2025-09-15 Mengen Fang , Lanqiang Li , Fuyin Tian , Li Liu

In this paper, we study negacyclic codes of odd length and of length $2^k$ over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u^2=0$. We give the complete structure of negacyclic codes for both the cases. We have obtained a minimal spanning set…

Information Theory · Computer Science 2014-12-12 Rama Krishna Bandi , Maheshanand Bhaintwal

In this paper, we study the theory for constructing DNA cyclic codes of odd length over $\Z_4[u]/\langle u^2 \rangle$ which play an important role in DNA computing. Cyclic codes of odd length over $\Z_4 + u \Z_4$ satisfy the reverse…

Information Theory · Computer Science 2015-08-11 Sukhamoy Pattanayak , Abhay Kumar Singh

In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew…

Information Theory · Computer Science 2018-11-09 Abdullah Dertli , Yasein Cengellenmis , Senol Eren

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…

Information Theory · Computer Science 2010-10-04 Somphong Jitman , San Ling , Patanee Udomkavanich

The structures of cyclic DNA codes of odd length over the finite rings R=Z_{4}+wZ_{4}, w^{2}=2 and S=Z_{4}+wZ_{4}+vZ_{4}+wvZ_{4},w^{2}=2,v^{2}=v,wv=vw are studied. The links between the elements of the rings R, S and 16 and 256 codons are…

Information Theory · Computer Science 2018-11-09 Abdullah Dertli , Yasemin Cengellenmis

Let p>3 be an odd prime and m be a positive integer. Little progress on the study of optimal p-ary cyclic codes with parameters [p^m-1,p^m-2m-2,4] has been made.In this paper, by weakening the necessary and sufficient conditions on cyclic…

Information Theory · Computer Science 2025-12-01 Jinmei Fan , Jingyao Feng , Yuhan Men , Yanhai Zhang

Let $p$ be an odd prime number, $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $s$ a positive integer. Using some combinatorial identities, we obtain certain properties for Kronecker product of matrices over $\mathbb{F}_p$…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Somphong Jitman

In this paper, we investigate cyclic code over the ring $\mathbb{F}_{p^k} + v\mathbb{F}_{p^k} + v^2\mathbb{F}_{p^k} + ... + v^r\mathbb{F}_{p^k}$, where $v^{r+1}=v$, $p$ a prime number, $r>1$ and $\gcd(r,p)=1$, we prove as generalisation of…

Information Theory · Computer Science 2015-11-09 Ousmane Ndiaye

In this paper, we introduce $\mathbb{Z}_{p^r}\mathbb{Z}_{p^r}\mathbb{Z}_{p^s}$-additive cyclic codes for $r\leq s$. These codes can be identified as $\mathbb{Z}_{p^s}[x]$-submodules of $\mathbb{Z}_{p^r}[x]/\langle x^{\alpha}-1\rangle \times…

Information Theory · Computer Science 2022-02-24 Cristina Fernández-Córdoba , Sachin Pathak , Ashish Kumar Upadhyay

Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…

Information Theory · Computer Science 2015-04-14 Eli Ben-Sasson , Tuvi Etzion , Ariel Gabizon , Netanel Raviv

Let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+u^3\mathbb{F}_{p}$ with $u^4=u$ be a finite non-chain ring, where $p$ is a prime congruent to $1$ modulo $3$. In this paper we study $(1-2u^3)$-constacyclic codes over the…

Number Theory · Mathematics 2016-03-11 Madhu Raka , Leetika Kathuria , Mokshi Goyal

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…

Information Theory · Computer Science 2024-06-27 Pavan Kumar , Noor Mohammad Khan

Let $ \mathbb F_2[u]/ \langle u^k \rangle= \mathbb F_2+u\mathbb F_2+u^2\mathbb F_2+\cdots+u^{k-1}\mathbb F_2 ,$ where $u^k=0$ for a positive integer $k$, and $\mathcal{R}=M_4 (\mathbb F_2( u)/ \langle u^k \rangle)$ be the finite…

Information Theory · Computer Science 2026-02-23 Soham Ravikant Joshi , Shikha Patel , Om Prakash