English
Related papers

Related papers: On $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-$(1+u)$-addit…

200 papers

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}[u]/\langle u^4\rangle)$ and $n$ is an odd positive integer. For any $\delta,\alpha\in \mathbb{F}_{2^m}^{\times}$, ideals of the ring $R[x]/\langle…

Information Theory · Computer Science 2016-09-21 Yonglin Cao , Yuan Cao

In this paper we study the structure and properties of additive right and left polycyclic codes induced by a binary vector $a$ in $\mathbb{F}_{2}^{n}.$ We find the generator polynomials and the cardinality of these codes. We also study…

Information Theory · Computer Science 2021-08-23 Arezoo Soufi Karbaski , Taher Abualrub , Nuh Aydin , Peihan Liu

This paper is devoted to the study of the construction of new quantum MDS codes. Based on constacyclic codes over Fq2 , we derive four new families of quantum MDS codes, one of which is an explicit generalization of the construction given…

Information Theory · Computer Science 2017-05-08 Mustafa Sari , Emre Kolotoglu

An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite…

Information Theory · Computer Science 2013-01-04 Bocong Chen , Yun Fan , Liren Lin , Hongwei Liu

In this paper, we discuss DNA codes that are cyclic or quasi-cyclic over $\Z_{4}+\omega \Z_{4}$, where $\omega^{2}=2+2\omega$ along with methods to construct these with combinatorial constraints. We also generalize results obtained for the…

Information Theory · Computer Science 2021-10-20 Adel Alahmadi , Alaa Altassan , Amani Alyoubi , Manish K. Gupta , Hatoon Shoaib

The aim of this paper is to determine the algebraic structure of multidimensional cyclic codes over a finite chain ring $\mathfrak{R}$. An algorithm to find the generator polynomials of $n$ dimensional ($n$D) cyclic codes of length…

Information Theory · Computer Science 2023-03-15 Disha , Sucheta Dutt

Let $\mathbb{F}_{p^m}$ be the field containing $p^m$ elements where $p$ is an odd prime and $m \in \mathbb{N}$. In this article, we propose a unified approach to the study of skew constacyclic codes of length $np^s$ over the ring $R_k =…

Information Theory · Computer Science 2026-05-18 Seema Chahal , Seema Antil , Sugandha Maheshwary , Manju Khan

Let $r,s,t$ be three positive integers and $\mathcal{C}$ be a binary linear code of lenght $r+s+t$. We say that $\mathcal{C}$ is a triple cyclic code of lenght $(r,s,t)$ over $\mathbb{Z}_2$ if the set of coordinates can be partitioned into…

Information Theory · Computer Science 2015-09-18 Hojjat Mostafanasab

In this paper, we study a family of constacyclic BCH codes over $\mathbb{F}_{q^2}$ of length $n=\frac{q^{2m}-1}{q+1}$, where $q$ is a prime power, and $m\geq2$ an even integer. The maximum design distance of narrow-sense Hermitian…

Information Theory · Computer Science 2020-07-28 X. Zhao , X. Li , Q. Wang , T. Yan

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é

The $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-additive codes are subgroups of $\mathbb{Z}_2^{\alpha_1} \times \mathbb{Z}_4^{\alpha_2} \times \mathbb{Z}_8^{\alpha_3}$, and can be seen as linear codes over $\mathbb{Z}_2$ when…

Information Theory · Computer Science 2023-01-24 Dipak K. Bhunia , Cristina Fernández-Córdoba , Mercè Villanueva

Let $\mathcal{R}_e=GR(p^e,r)[y]/\langle g(y),p^{e-1}y^t\rangle$ be a finite commutative chain ring, where $p$ is a prime number, $GR(p^e,r)$ is the Galois ring of characteristic $p^e$ and rank $r,$ $t$ and $k$ are positive integers…

Information Theory · Computer Science 2024-12-16 Leijo Jose , Anuradha Sharma

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

A code $C = \Phi(\mathcal{C})$ is called $\mathbb{Z}_p \mathbb{Z}_{p^2}$-linear if it's the Gray image of the $\mathbb{Z}_p \mathbb{Z}_{p^2}$-additive code $\mathcal{C}$. In this paper, the rank and the dimension of the kernel of…

Information Theory · Computer Science 2022-06-30 Xuan Wang , Minjia Shi

In this paper, we study cyclic codes over the ring $ \Z_p + u\Z_p +...+ u^{k-1}\Z_p $, where $u^k =0$. We find a set of generator for these codes. We also study the rank, the dual and the Hamming distance of these codes.

Information Theory · Computer Science 2012-05-21 Abhay Kumar Singh , Pramod Kumar Kewat

Let $R$ be the finite chain ring $\mathbb{F}_{p^{2m}}+{u}\mathbb{F}_{p^{2m}}$, where $\mathbb{F}_{p^{2m}}$ is the finite field with $p^{2m}$ elements, $p$ is a prime, $m$ is a non-negative integer and ${u}^{2}=0.$ In this paper, we firstly…

Information Theory · Computer Science 2024-08-29 Yongsheng Tang , Ting Yao , Heqian Xu , Xiaoshan Kai

The purpose of this article is to study constacyclic codes of length $np^s$ over $R^t:=\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle },$ where $t$ is a natural number and $\gcd(n,p)=1$. We give generators of all the ideals of…

Information Theory · Computer Science 2026-05-13 Akanksha Tiwari , Pramod Kanwar , Ritumoni Sarma

In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we…

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

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

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
‹ Prev 1 4 5 6 7 8 10 Next ›