English
Related papers

Related papers: A class of constacyclic codes over $\mathbb{F}_{p^…

200 papers

It's well known that the quadratic residue code over finite fields is an interesting class of cyclic codes for its higher minimum distance. Let $g$ be a positive integer and $p,p_{1},\ldots, p_{g}$ be distinct odd primes, the present paper…

Number Theory · Mathematics 2020-01-08 Qunying Liao , Yuanbo Liu

Let q be a prime power and F_q be a finite field. In this paper, we study constacyclic codes over the ring F_q+ u F_q +v F_q+ u v F_q, where u^2=u, v^2=v and uv=vu. We characterized the generator polynomials of constacyclic codes and their…

Information Theory · Computer Science 2016-05-03 Joël Kaboré , Mohammed E. Charkani

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

In this paper, we construct several infinite families of $q$-ary constacyclic codes over a finite field $\mathbb{F}_q$ with length $n$, dimension around $n/2$, and minimum distance at least $cn/\log_q n$ for some positive constant $c$. They…

Information Theory · Computer Science 2026-05-29 Zekai Chen , Min Sha

Codes over Galois rings have been studied extensively during the last three decades. Negacyclic codes over $GR(2^a,m)$ of length $2^s$ have been characterized: the ring $\mathcal{R}_2(a,m,-1)= \frac{GR(2^a,m)[x]}{\langle x^{2^s}+1\rangle}$…

Information Theory · Computer Science 2017-08-16 Hongwei Liu , Youcef Maouche

Let $R$ be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of $R[X]/<g>$ where $g$ is a regular polynomial in $R[X]$. We use this set to decompose the ring…

Information Theory · Computer Science 2019-08-21 Mohammed Elhassani Charkani , Joël Kabore

Let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+u^3\mathbb{F}_{p}$ with $u^4=u$ be a finite non-chain ring, where $p$ is a prime congruent to $1$ modulo $3$. In this paper we study $(1-2u^3)$-constacyclic codes over the…

Number Theory · Mathematics 2016-03-11 Madhu Raka , Leetika Kathuria , Mokshi Goyal

Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic…

Information Theory · Computer Science 2024-04-30 Tingfang Chen , Zhonghua Sun , Conghui Xie , Hao Chen , Cunsheng Ding

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 article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring $\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangle$ where $p$ is an odd prime and $m \geq 1$. In order to…

Information Theory · Computer Science 2020-10-15 Ram Krishna Verma , Om Prakash , Ashutosh Singh

In this paper, several families of irreducible constacyclic codes over finite fields and their duals are studied. The weight distributions of these irreducible constacyclic codes and the parameters of their duals are settled. Several…

Information Theory · Computer Science 2022-07-06 Zhonghua Sun , Xiaoqiang Wang , Cunsheng Ding

We first define a new Gray map from $R=\mathbb{Z}_4+u\mathbb{Z}_4$ to $\mathbb{Z}^{2}_{4}$, where $u^2=1$ and study $(1+2u)$-constacyclic codes over $R$. Also of interest are some properties of $(1+2u)$-constacyclic codes over $R$.…

Information Theory · Computer Science 2016-12-28 Minjia Shi , Liqing Qian , Lin Sok , Nuh Aydin , Patrick Solé

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

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

In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…

Information Theory · Computer Science 2026-05-28 Cristina Flaut , Bianca Liana Bercea-Straton

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

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^2)$-constacyclic codes over the ring $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$, where $u^3=u$. We describe generator polynomials of this kind…

Information Theory · Computer Science 2015-06-25 Hojjat Mostafanasab , Negin Karimi

Let $p$ be a prime integer, $n,s\geq 2$ be integers satisfying ${\rm gcd}(p,n)=1$, and denote $R=\mathbb{Z}_{p^s}[v]/\langle v^2-pv\rangle$. Then $R$ is a local non-principal ideal ring of $p^{2s}$ elements. First, the structure of any…

Information Theory · Computer Science 2017-10-27 Yuan Cao , Yonglin Cao

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$ and $s$ a positive integer. Using properties for Kronecker product of matrices and calculation for linear equations over $\mathbb{F}_{2^m}$, an efficient method for the…

Information Theory · Computer Science 2018-11-28 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Somphong Jitman