English
Related papers

Related papers: Characterization of the skew cyclic codes over Fp+…

200 papers

A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…

Information Theory · Computer Science 2016-09-26 Gerardo Vega

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…

Information Theory · Computer Science 2018-10-16 Ahlem Melakhessou , Nuh Aydin , Kenza Guenda

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

Information Theory · Computer Science 2017-07-19 Supawadee Prugsapitak , Somphong Jitman

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

Let $\mathbb{F}_{p^{m}}$ be a finite field with cardinality $p^{m}$ and $R=\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$ with $u^{2}=0$. We aim to determine all $\alpha+u\beta$-constacyclic codes of length $np^{s}$ over $R$, where…

Information Theory · Computer Science 2016-06-22 Wei Zhao , Xilin Tang , Ze Gu

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^k)$-constacyclic codes over the ring $\mathcal{R}=\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p+u^{3}\mathbb{F}_{p}+\cdots+u^{k}\mathbb{F}_{p}$ where…

Information Theory · Computer Science 2019-04-18 Zahid Raza , Amrina Rana

In this paper, a family of cyclic codes over $\mathbb{F}_{p}$ whose duals have five zeros is presented, where $p$ is an odd prime. Furthermore, the weight distributions of these cyclic codes are determined.

Information Theory · Computer Science 2015-02-10 Yan Liu , Chunlei Liu

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…

Information Theory · Computer Science 2015-11-18 Yonglin Cao , Yuan Cao , Fang-Wei Fu

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

We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and…

Information Theory · Computer Science 2019-04-26 Bustomi , Aditya Purwa Santika , Djoko Suprijanto

Let $R=\mathbb{Z}_{4}[u]/\langle u^k\rangle=\mathbb{Z}_{4}+u\mathbb{Z}_{4}+\ldots+u^{k-1}\mathbb{Z}_{4}$ ($u^k=0$) where $k\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of…

Information Theory · Computer Science 2016-06-17 Cao Yuan , Li Qingguo

Let $\mathbb{Z}_{p}$ be the ring of residue classes modulo a prime $p$. The $\mathbb{Z}_{p}\mathbb{Z}_{p}[u,v]$-additive cyclic codes of length $(\alpha,\beta)$ is identify as $\mathbb{Z}_{p}[u,v][x]$-submodule of $\mathbb{Z}_{p}[x]/\langle…

Information Theory · Computer Science 2023-04-11 Habibul Islam , Om Prakash

In this paper, a family of reducible cyclic codes over GF(p) whose duals have four zeros is presented, where p is an odd prime. Furthermore, the weight distribution of these cyclic codes is determined.

Information Theory · Computer Science 2014-04-09 Yan Liu

We study skew polycyclic codes over a finite field $\mathbb{F}_q$, associated with a skew polynomial $f(x) \in \mathbb{F}_q[x;\sigma]$, where $\sigma$ is an automorphism of $\mathbb{F}_q$. We start by proving the Roos-like bound for both…

Information Theory · Computer Science 2025-07-29 Hassan Ou-azzou , Anna-Lena Horlemann , Nuh Aydin

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…

Information Theory · Computer Science 2023-04-07 Nikita Jain , Sucheta Dutt , Ranjeet Sehmi

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $R=\mathbb{F}_{p^m}[u]/\langle u^2\rangle=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ $(u^2=0)$, where $p$ is a prime and $m$ is a positive integer. For any $\lambda\in…

Information Theory · Computer Science 2017-10-25 Yonglin Cao , Yuan Cao , Jian Gao , Fang-wei Fu

Let $R^t$ denote the finite chain ring $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle},$ where $p$ is a prime and $t$ is a positive integer. In this article, for a prime $p$ and an automorphism $\theta$ of $\mathbb{F}_{p^m}$, we give the…

Information Theory · Computer Science 2026-05-14 Akanksha Tiwari , Ritumoni Sarma

In this paper, we study the structure of 1-generator quasi-cyclic codes over the ring R = F2 + uF2 + vF2 + uvF2, with u2 = v2 = 0 and uv = vu. We determine the minimal spanning sets for these codes. As a generalization of these codes, we…

Information Theory · Computer Science 2017-05-26 Srinivasulu B , Maheshanand Bhaintwal

Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…

Information Theory · Computer Science 2012-07-12 Cunsheng Ding

We define a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa. This kind of code can be seen as an extension of two well-known codes in literature, called…

Information Theory · Computer Science 2016-05-13 Stefano Bilotta