English
Related papers

Related papers: $(\Theta, \Delta_\Theta, \mathbf{a})$-cyclic codes…

200 papers

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 article, we introduce and study the concept of the exponent of a cyclic code over a finite field $\mathbb{F}_q.$ We give a relation between the exponent of a cyclic code and its dual code. Finally, we introduce and determine the…

Information Theory · Computer Science 2020-09-25 N. Annamalai , C. Durairajan

In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…

Algebraic Geometry · Mathematics 2021-06-17 Gustavo Cabaña , María Chara , Ricardo A. Podestá , Ricardo Toledano

A new Gray map which is both an isometry and a weight preserving map from R=F_2+vF_2+v^2F_2 to (F_2)^3 is defined. A construction for quantum error correcting codes from cyclic codes over finite ring R=F_2+vF_2+v^2F_2, v^3=v is given. The…

Information Theory · Computer Science 2014-07-07 Abdullah Dertli , Yasemin Cengellenmis , Senol Eren

Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x^n-1), where F is a finite field. If this automorphism itself has certain specific cyclicity properties one is lead to the class of…

Rings and Algebras · Mathematics 2007-07-16 Heide Gluesing-Luerssen , Wiland Schmale

Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length $s\ell$ with index $s$ over the finite field $\mathbb{F}$ are $\mathbb{F}[y]$-submodules of the ring $\frac{\mathbb{F}[x,y]}{<…

Information Theory · Computer Science 2017-05-01 Zahra Sepasdar

Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…

Information Theory · Computer Science 2022-12-07 Swati Bhardwaj , Mokshi Goyal , Madhu Raka

Let $q$ be a power of a prime $p$. In this paper, we study reversible cyclic codes of arbitrary length over the ring $ R = \mathbb{F}_q + u \mathbb{F}_q$, where $u^2=0 mod q$. First, we find a unique set of generators for cyclic codes over…

Information Theory · Computer Science 2019-10-16 Om Prakash , Shikha Patel , Shikha Yadav

In this paper, we investigate the algebraic structure for polycyclic codes over a specific class of serial rings, defined as $\mathscr R=R[x_1,\ldots, x_s]/\langle t_1(x_1),\ldots, t_s(x_s) \rangle$, where $R$ is a chain ring and each…

Information Theory · Computer Science 2025-03-06 Maryam Bajalan , Edgar Martinez-Moro

In this paper, we study the algebraic structure of $(\sigma,\delta)$-polycyclic codes, defined as submodules in the quotient module $S/Sf$, where $S=R[x,\sigma,\delta]$ is the Ore extension ring, $f\in S$, and $R$ is a finite but not…

Information Theory · Computer Science 2024-03-01 Maryam Bajalan , Ivan Landjev , Edgar Martínez-Moro , Steve Szabo

We characterize the structure of 2-quasi-cyclic codes over a finite field F by the so-called Goursat Lemma. With the characterization, we exhibit a necessary and sufficient condition for a 2-quasi-cyclic code being a dihedral code. And we…

Information Theory · Computer Science 2022-01-06 Yun Fan , Yuchang Zhang

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

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…

Information Theory · Computer Science 2018-01-09 Habibul Islam , Om Prakash

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…

Information Theory · Computer Science 2008-09-16 Taher Abualrub , Ali Ghrayeb , Nuh Aydin , Irfan Siap

Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the…

Information Theory · Computer Science 2026-05-08 Hongsheng Hu , Nian Li , Yanan Wu , Xiangyong Zeng

In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of $\mathcal{R}=\prod_{i=1}^t F_q$ is determined, and we characterize skew constacyclic codes over ring by linear…

Information Theory · Computer Science 2022-06-06 Ying Zhao

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

In this paper, we mainly study the theory of linear codes over the ring $R =\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$. By the Chinese Remainder Theorem, we have $R$ is isomorphic to the direct sum of four rings…

Information Theory · Computer Science 2016-01-19 Ping Li , Xuemei Guo , Shixin Zhu

Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…

Information Theory · Computer Science 2024-12-03 Cunsheng Ding

Let $F$ be a number field with ring of integers $\Oc_F$ and $\Dc$ a division $F$-algebra with a maximal cyclic subfield $K$. We study rings occurring as quotients of a natural $\Oc_F$-order $\Lambda$ in $\Dc$ by two-sided ideals. We reduce…

Information Theory · Computer Science 2012-10-29 Frederique Oggier , B. A. Sethuraman