English
Related papers

Related papers: Quadratic Residue Codes over $\mathbb{Z}_{121}$

200 papers

Locally repairable codes (LRCs) have emerged as an important coding scheme in distributed storage systems (DSSs) with relatively low repair cost by accessing fewer non-failure nodes. Theoretical bounds and optimal constructions of LRCs have…

Information Theory · Computer Science 2023-03-14 Weijun Fang , Fang-Wei Fu , Bin Chen , Shu-Tao Xia

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

Information Theory · Computer Science 2017-07-19 Supawadee Prugsapitak , Somphong Jitman

Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…

Information Theory · Computer Science 2026-05-25 Gustavo Terra Bastos , Angelynn Álvarez , Cameron Williams

Cyclic codes are an important subclass of linear codes with wide applications in communication systems and data storage systems. In 2013, Ding and Helleseth presented nine open problems on optimal ternary cyclic codes $\mathcal{C}_{(1,e)}$.…

Information Theory · Computer Science 2026-01-21 Jingjun Bao , Hanlin Zou

Let $R=\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ be a non-chain finite commutative ring, where $u^3=u$. In this paper, we mainly study the construction of quantum codes from cyclic codes over $R$. We obtained self-orthogonal codes over…

Information Theory · Computer Science 2016-01-13 Sukhamoy Pattanayak , Abhay Kumar Singh , Pratyush Kumar

This paper provides a comprehensive analysis of almost maximum distance separable (AMDS) constacyclic codes of length $4p^{\varsigma}$ over the finite field $\mathbb{F}_{p^m}$, where $p$ is an odd prime number. Furthermore, it introduces…

Combinatorics · Mathematics 2026-05-25 Manasa K J , Divya Acharya , Prasanna Poojary

In this paper we investigate the structure of repeated root constacyclic codes of length $2^amp^r$ over $\mathbb{F}_{p^s}$ with $a\geq1$ and $(m,p)=1$. We characterize the codes in terms of their generator polynomials. This provides simple…

Information Theory · Computer Science 2015-05-05 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

We begin this chapter by introducing the simple algebraic structure of cyclic codes over finite fields. This structure undergoes a series of generalizations to present algebraic descriptions of constacyclic, quasi-cyclic (QC), quasi-twisted…

Information Theory · Computer Science 2022-04-08 Ramy Taki ElDin

Given a subgroup $H$ of a group $(G,+)$, a $(G,H,k,1)$ difference family (DF) is a set $\mathcal F$ of $k$-subsets of $G$ such that $\{f-f':f,f'\in F, f\neq f',F\in \mathcal F\}=G\setminus H$. Let $g\mathbb Z_{gh}$ is the subgroup of order…

Combinatorics · Mathematics 2023-06-22 Chenya Zhao , Binwei Zhao , Yanxun Chang , Tao Feng , Xiaomiao Wang , Menglong Zhang

Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing $x^n-\lambda$ over $\mathbb{F}_{q^2}$ is given, where $\lambda$ is a unit in $\mathbb{F}_{q^2}$. Based on this…

Rings and Algebras · Mathematics 2016-01-05 Ekkasit Sangwisut , Somphong Jitman , Patanee Udomkavanich

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

In addition to their applications in data storage, communications systems, and consumer electronics, LCD codes -- a class of linear codes -- have been employed in cryptography recently. LCD cyclic codes were referred to as reversible cyclic…

Information Theory · Computer Science 2017-01-03 Chengju Li , Cunsheng Ding , Shuxing Li

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é

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these…

Combinatorics · Mathematics 2008-01-09 Lars Eirik Danielsen , Matthew G. Parker

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

The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially when it comes to cyclic codes. Recently, the first infinite…

Information Theory · Computer Science 2025-04-17 Xiaoqiang Wang , Liuyi Li , Yansheng Wu , Dabin Zheng , Shuxian Lu

This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…

Information Theory · Computer Science 2024-12-19 Tushar Bag , Hai Q Dinh , Daniel Panario

In this paper we study $\prod\limits_{i=1}^{n} \mathbb{Z}_{2^i}$-Additive Cyclic Codes. These codes are identified as $\mathbb{Z}_{2^n}[x]$-submodules of $\prod\limits_{i=1}^{n}\mathbb{Z}_{2^i}[x]/ \langle x^{\alpha_i}-1\rangle$; $\alpha_i$…

Information Theory · Computer Science 2017-08-24 Tapabrata Roy , Santanu Sarkar

We give a polynomial representation for additive cyclic codes over $\mathbb{F}_{p^2}$. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator…

Information Theory · Computer Science 2023-01-03 Reza Dastbasteh , Khalil Shivji

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