English
Related papers

Related papers: One-Sided Repeated-Root Two-Dimensional Cyclic and…

200 papers

A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…

Information Theory · Computer Science 2016-09-26 Gerardo Vega

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

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é

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

In this paper, we study $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-$(1+u)$-additive constacyclic code of arbitrary length. Firstly, we study the algebraic structure of this family of codes and a set of generator polynomials for this family as a…

Information Theory · Computer Science 2016-11-11 Ping Li , Wei Dai , Xiaoshan Kai

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

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…

Information Theory · Computer Science 2025-04-22 Mrinal Kanti Bose , Udaya Parampalli , Abhay Kumar Singh

In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…

Algebraic Geometry · Mathematics 2021-06-17 Gustavo Cabaña , María Chara , Ricardo A. Podestá , Ricardo Toledano

Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…

Information Theory · Computer Science 2016-03-14 Odessa D. Consorte , Lilibeth D. Valdez

We study complementary information set codes of length $tn$ and dimension $n$ of order $t$ called ($t-$CIS code for short). Quasi-cyclic and quasi-twisted $t$-CIS codes are enumerated by using their concatenated structure. Asymptotic…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Hatoon Shoaib , Patrick Solé

It is proved in a reference (Fan, Lin, IEEE TIT, vol.67, pp.5016-5025) that the self-dual (LCD respectively) dihedral codes over a finite field~$F$ with ${|F|=q}$ are asymptotically good if $q$ is even (odd respectively). In this paper, we…

Information Theory · Computer Science 2023-03-02 Yun Fan , Yue Leng

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

Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…

Information Theory · Computer Science 2017-09-25 Minjia Shi , Hongwei Zhu , Patrick Sole

This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional…

Information Theory · Computer Science 2025-04-22 Kanat Abdukhalikov , Tushar Bag , Daniel Panario

Codes which have a finite field $\mathbb{F}_{q^m}$ as their alphabet but which are only linear over a subfield $\mathbb{F}_q$ are a topic of much recent interest due to their utility in constructing quantum error correcting codes. In this…

Information Theory · Computer Science 2026-04-30 Daniel Bossaller , Daniel Herden , Indalecio Ruiz-Bolaños

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

Number Theory · Mathematics 2021-01-26 Minsik Han

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

An important family of codes for data storage systems, cryptography, consumer electronics, and network coding for error control in digital communications are the so-called cyclic codes. This kind of linear codes are also important due to…

Information Theory · Computer Science 2025-06-16 Gerardo Vega , Félix Hernández

In this paper, we shall give an explicit proof that constacyclic codes over finite commutative rings can be realized as ideals in some twisted group rings. Also, we shall study isometries between those codes and, finally, we shall study…

Information Theory · Computer Science 2023-07-26 Samir Assuena

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