English
Related papers

Related papers: Quantum Codes from additive constacyclic codes ove…

200 papers

Quantum maximum-distance-separable (MDS) codes are an important class of quantum codes. In this paper, using constacyclic codes and Hermitain construction, we construct some new quantum MDS codes of the form $q=2am+t$,…

Information Theory · Computer Science 2018-03-22 Liangdong Lu , Wenping Ma , Ruihu Li , Yuena Ma , Luobin Guo

Cyclic codes over R have been introduced recently. In this paper, we study the cyclic codes over R and their $\Z_2$ image. Making use of algebraic structure, we find the some good $\Z_2$ codes of length 28.

Information Theory · Computer Science 2015-07-20 Sukhamoy Pattanayak , Abhay Kumar Singh

In quantum coding theory, stabilizer codes are probably the most important class of quantum codes. They are regarded as the quantum analogue of the classical linear codes and the properties of stabilizer codes have been carefully studied in…

Quantum Physics · Physics 2012-02-28 Ching-Yi Lai , Chung-Chin Lu

In this work, we study a class of skew cyclic codes over the ring $R:=\mathbb{Z}_4+v\mathbb{Z}_4,$ where $v^2=v,$ with an automorphism $\theta$ and a derivation $\Delta_\theta,$ namely codes as modules over a skew polynomial ring…

Information Theory · Computer Science 2024-01-25 Djoko Suprijanto , Hopein Christofen Tang

This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…

Information Theory · Computer Science 2025-06-13 Sanjit Bhowmick , Kuntal Deka , Alexandre Fotue Tabue , Edgar Martínez-Moro

We introduce an additive but not $\mathbb{F}_4$-linear map $S$ from $\mathbb{F}_4^{n}$ to $\mathbb{F}_4^{2n}$ and exhibit some of its interesting structural properties. If $C$ is a linear $[n,k,d]_4$-code, then $S(C)$ is an additive…

Information Theory · Computer Science 2020-04-28 Martianus Frederic Ezerman , San Ling , Patrick Sole , Olfa Yemen

Linear complementary pairs (LCPs) of codes have been studied since they were introduced in the context of discussing mitigation measures against possible hardware attacks to integrated circuits. In this situation, the security parameters…

Information Theory · Computer Science 2025-02-05 F. J. Lobillo , José Manuel Muñoz

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. It is very hard to construct quantum MDS codes with relatively large minimum distance. In this paper, based on classical constacyclic codes, we…

Information Theory · Computer Science 2014-05-22 Liqi Wang , Shixin Zhu

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

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, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-03-21 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Solé

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-01-10 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Sole

Let $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field…

Information Theory · Computer Science 2024-06-21 Lanqiang Li , Ziwen Cao , Tingting Wu , Li Liu

Constacyclic codes over finite fields are a family of linear codes and contain cyclic codes as a subclass. Constacyclic codes are related to many areas of mathematics and outperform cyclic codes in several aspects. Hence, constacyclic codes…

Information Theory · Computer Science 2022-08-29 Zhonghua Sun , Cunsheng Ding , Xiaoqiang Wang

Let $p$ be a prime number. In this paper, we discuss the structures of cyclic codes over the ring $ \mathbb{F}_p[u, v] / \langle u^k, v^2, uv-vu\rangle$. We find a unique set of generators for these codes. We also study the rank and the…

Information Theory · Computer Science 2015-08-31 Bappaditya Ghosh , Pramod Kumar Kewat

In this paper, we study skew cyclic codes over the ring $R=\F_q+u\F_q+v\F_q+uv\F_q$, where $u^{2}=u,v^{2}=v,uv=vu$, $q=p^{m}$ and $p$ is an odd prime. We investigate the structural properties of skew cyclic codes over $R$ through a…

Information Theory · Computer Science 2015-04-30 Ting Yao , Minjia Shi , Patrick Solé

For any given positive integer $m$, a necessary and sufficient condition for the existence of Type I $m$-adic constacyclic codes is given. Further, for any given integer $s$, a necessary and sufficient condition for $s$ to be a multiplier…

Information Theory · Computer Science 2014-07-09 Bocong Chen , Hai Q. Dinh , Yun Fan , San Ling

We introduce quantum pin codes: a class of quantum CSS codes. Quantum pin codes are a generalization of quantum color codes and Reed-Muller codes and share a lot of their structure and properties. Pin codes have gauge operators, an…

Quantum Physics · Physics 2022-05-03 Christophe Vuillot , Nikolas P. Breuckmann

In this paper, we investigate cyclic codes over the ring $ \mathbb{F}_p[u,v,w]\langle u^2,$ $v^2, w^2$, $uv-vu, vw-wv, uw-wu \rangle$, where $p$ is a prime number. Which is a part of family of Frobenius rings. We find a unique set of…

Information Theory · Computer Science 2015-09-30 Pramod Kumar Kewat , Sarika Kushwaha

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…

Information Theory · Computer Science 2013-07-09 Jian Gao , Fang-Wei Fu , Linzhi Shen