English
Related papers

Related papers: Double skew cyclic codes over $\mathbb{F}_q+v\math…

200 papers

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen

In this paper, we construct self-dual codes from a construction that involves 2x2 block circulant matrices, group rings and a reverse circulant matrix. We provide conditions whereby this construction can yield self-dual codes. We construct…

Rings and Algebras · Mathematics 2020-02-25 Joe Gildea , Abidin Kaya , Rhian Taylor , Alexander Tylyshchak

Additive conjucyclic codes over $\F_{q^2}$ are closed under the conjugated cyclic shift and play an important role in constructing quantum error-correcting codes (QECCs). However, a systematic algebraic theory for such codes over general…

Information Theory · Computer Science 2026-03-31 Jingjie Lv , Xian Lian , Ruihu Li , Hanxu Hou

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

In this paper, we consider some structures of linear codes over the ring $\mathcal{R}_k=R[v_1,\dots,v_k],$ where $v_i^2=v_i$ forall $i=1,\dots,k),$ and $R$ is a finite commutative Frobenius ring.

Information Theory · Computer Science 2019-04-16 Irwansyah , Djoko Suprijanto

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…

Information Theory · Computer Science 2025-02-25 Om Prakash , Shikha Patel , Habibul Islam

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

Z2Z4-additive codes have been defined as a subgroup of Z2^{r} x Z4^{s} in [5] where Z2, Z4 are the rings of integers modulo 2 and 4 respectively and r and s positive integers. In this study, we define a new family of codes over the set…

Information Theory · Computer Science 2017-11-07 Ismail Aydogdu , Fatmanur Gursoy

It is recently conjectured in quantum information processing that phase-shift errors occur with high probability than qubit-flip errors, hence the former is more disturbing to quantum information than the later one. This leads us to…

Information Theory · Computer Science 2009-11-30 Salah A. Aly

The paper has a threefold purpose. The first purpose is to present an explicit description of expanded cyclic codes defined in $\GF(q^m)$. The proposed explicit construction of expanded generator matrix and expanded parity check matrix…

Information Theory · Computer Science 2008-07-08 Yingquan Wu

It is known that a linear two-weight code $C$ over a finite field $\F_q$ corresponds both to a multiset in a projective space over $\F_q$ that meets every hyperplane in either $a$ or $b$ points for some integers $a<b$, and to a strongly…

Combinatorics · Mathematics 2007-09-07 E. Byrne , M. Greferath , T. Honold

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.…

Information Theory · Computer Science 2014-06-05 Pramod Kumar Kewat , Bappaditya Ghosh , Sukhamoy Pattanayak

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Fanghui Ma

It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…

Information Theory · Computer Science 2023-01-09 Chaofeng Guan , Ruihu Li , Liangdong Lu , Yu Yao

In this paper, we have studied cyclic codes over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u^2=0$. We have considered cyclic codes of odd lengths. A sufficient condition for a cyclic code over $R$ to be a $\mathbb{Z}_4$-free module is…

Information Theory · Computer Science 2015-01-08 Rama Krishna Bandi , Maheshanand Bhaintwal

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

In this work, a unique set of generators for a cyclic code over a finite chain ring has been established. The minimal spanning set and rank of the code have also been determined. Further, sufficient as well as necessary conditions for a…

Information Theory · Computer Science 2023-03-29 Monika Dalal , Sucheta Dutt , Ranjeet Sehmi

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

Information Theory · Computer Science 2017-09-19 E. Martínez-Moro , A. Piñera-Nicolás , I. F. Rúa

We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…

Information Theory · Computer Science 2017-01-05 Yan Liu , Minjia Shi , Patrick Solé

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…

Information Theory · Computer Science 2018-08-21 Binbin Pang , Shixin Zhu , Ping Li
‹ Prev 1 4 5 6 7 8 10 Next ›