English
Related papers

Related papers: Repeated-root constacyclic codes over the finite c…

200 papers

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

Let $\mathbb{F}_{q}$ be a finite field of cardinality $q$, $R=\mathbb{F}_{q}[u]/\langle u^4\rangle=\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}+u^3\mathbb{F}_{q}$ $(u^4=0)$ which is a finite chain ring, and $n$ be a positive integer…

Information Theory · Computer Science 2015-11-10 Yuan Cao , Yonglin Cao , Jian Gao

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

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

A code is called a locally repairable code (LRC) if any code symbol is a function of a small fraction of other code symbols. When a locally repairable code is employed in a distributed storage systems, an erased symbol can be recovered by…

Information Theory · Computer Science 2021-11-25 Wei Zhao , Kenneth W. Shum , Shenghao Yang

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

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

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…

Information Theory · Computer Science 2010-10-04 Somphong Jitman , San Ling , Patanee Udomkavanich

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

Cyclic codes are the most studied subclass of linear codes and widely used in data storage and communication systems. Many cyclic codes have optimal parameters or the best parameters known. They are divided into simple-root cyclic codes and…

Information Theory · Computer Science 2024-05-24 Hao Chen , Conghui Xie , Cunsheng Ding

Let $f(u)$ and $g(v)$ be two polynomials of degree $k$ and $\ell$ respectively, not both linear, which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle f(u),g(v),\\uv-vu\rangle$ be a…

Information Theory · Computer Science 2019-05-31 Swati Bhardwaj , Madhu Raka

In this paper, we investigate polycyclic codes associated with a trinomial of arbitrary degree $n$ over a finite chain ring $ R.$ We extend the concepts of $ n $-isometry and $ n $-equivalence known for constacyclic codes to this class of…

Information Theory · Computer Science 2025-03-18 Abdelghaffar Chibloun , Hassan Ou-azzou , Edgar Martínez-Moro , Mustapha Najmeddine

For units $\delta$ and $\alpha$ in $\F_{p^m}$, the structure of $(\delta+\alpha u^2)$-constacyclic codes of length $p^k$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m}$ is studied and self-dual $(\delta+\alpha…

Information Theory · Computer Science 2017-02-16 Reza Sobhani , Zhonghua Sun , Liqi Wang , Shixin Zhu

In this paper we introduce the notion of $\lambda$-constacyclic codes over finite rings $R$ for arbitary element $\lambda$ of $R$. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal…

Information Theory · Computer Science 2020-11-25 Hongwei Liu , Jingge Liu

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

We characterize constacyclic codes in the spectral domain using the finite field Fourier transform (FFFT) and propose a reduced complexity method for the spectral-domain decoder. Further, we also consider repeated-root constacyclic codes…

Quantum Physics · Physics 2024-07-25 Shikha Patel , Shayan Srinivasa Garani

$(1+pw)$-constacyclic codes of arbitrary length over the non-principal ideal ring $\mathbb{Z}_{p^s} +u\mathbb{Z}_{p^s}$ are studied, where $p$ is a prime, $w\in \mathbb{Z}_{p^s}^{\times}$ and $s$ an integer satisfying $s\geq 2$. First, the…

Information Theory · Computer Science 2017-03-03 Yuan Cao , Yonglin Cao

Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic…

Rings and Algebras · Mathematics 2012-10-02 Sergio R. Lopez-Permouth , Hakan Ozadam , Ferruh Ozbudak , Steve Szabo

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

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é