English
Related papers

Related papers: How many weights can a cyclic code have ?

200 papers

We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…

Number Theory · Mathematics 2025-06-03 José G. Coelho , F. E. Brochero Martínez

Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of $q$-ary linear codes derived from irreducible cyclic…

Information Theory · Computer Science 2016-04-18 Ziling Heng , Qin Yue

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. GHWs are of great interest in many applications since they convey detailed information of linear codes. In this paper, we continue the work of [10] to study…

Information Theory · Computer Science 2017-02-07 Shuxing Li

Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…

Information Theory · Computer Science 2017-09-19 Minjia Shi , Zhongyi Zhang , Patrick Sole

A cyclic codes of length $n$ over the rings $Z_{2^{m}}$ of integer of modulo $2^{m}$ is a linear code with property that if the codeword $(c_0,c_1,...,c_{n-1})\in \mathcal{C}$ then the cyclic shift $(c_1,c_2,...,c_0)\in \mathcal{C}$.…

Rings and Algebras · Mathematics 2011-12-19 Xiongqing Tan

For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we…

Information Theory · Computer Science 2024-05-31 Chiara Castello , Olga Polverino , Ferdinando Zullo

Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many…

Information Theory · Computer Science 2013-01-15 Jing Yang , Maosheng Xiong , Cunsheng Ding

Cyclic codes have attracted a lot of research interest for decades as they have efficient encoding and decoding algorithms. In this paper, for an odd prime $p$, the weight distributions of two classes of $p$-ary cyclic codes are completely…

Information Theory · Computer Science 2017-07-07 Shudi Yang , Zheng-An Yao , Chang-An Zhao

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Cyclic codes have been studied for many years, but their weight…

Information Theory · Computer Science 2013-06-25 Chengju Li , Qin Yue

Let p>3 be an odd prime and m be a positive integer. Little progress on the study of optimal p-ary cyclic codes with parameters [p^m-1,p^m-2m-2,4] has been made.In this paper, by weakening the necessary and sufficient conditions on cyclic…

Information Theory · Computer Science 2025-12-01 Jinmei Fan , Jingyao Feng , Yuhan Men , Yanhai Zhang

In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length $n$ over a finite field $\mathbb F_q$, in the case which each prime divisor of $n$ is also a divisor of $q-1$.

Information Theory · Computer Science 2014-05-12 F. E. Brochero Martínez , C. R. Giraldo Vergara

A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…

Information Theory · Computer Science 2021-07-12 Gerardo Vega , Félix Hernández

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

Information Theory · Computer Science 2019-11-19 Minjia Shi , Tor Helleseth , Patrick Sole

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

Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first…

Information Theory · Computer Science 2016-11-18 Cunsheng Ding

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

Information Theory · Computer Science 2007-07-13 Beniamin Mounits , Tuvi Etzion , Simon Litsyn

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-01-18 Hai Liu , Chengju Li , Cunsheng Ding

The interrelation between the cyclic structure of an ideal, i.e., a cyclic code over Galois field $GF(q)$, $q>2$, and its classes of proportional elements is considered. This relation is used in order to define the code's weight structure.…

Number Theory · Mathematics 2007-05-23 I. Mullayeva

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, almost perfect nonlinear…

Information Theory · Computer Science 2012-06-22 Cunsheng Ding

Let $\Bbb F_r$ be an extension of a finite field $\Bbb F_q$ with $r=q^m$. Let each $g_i$ be of order $n_i$ in $\Bbb F_r^*$ and $\gcd(n_i, n_j)=1$ for $1\leq i \neq j \leq u$. We define a cyclic code over $\Bbb F_q$ by $$\mathcal C_{(q, m,…

Information Theory · Computer Science 2013-07-02 Chengju Li , Qin Yue , Fengwei Li