English
Related papers

Related papers: A class of cyclotomic linear codes and their gener…

200 papers

We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences…

Information Theory · Computer Science 2012-07-27 Vladimir Edemskiy

Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime $p$, we propose a class of $p$-ary linear codes by choosing a proper defining set.…

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

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian

In this expository paper we show how one can, in a uniform way, calculate the weight distributions of some well-known binary cyclic codes. The codes are related to certain families of curves, and the weight distributions are related to the…

Number Theory · Mathematics 2016-09-06 René Schoof

Recently, $b$-symbol codes are proposed to protect against $b$-symbol errors in $b$-symbol read channels. It is an interesting subject of study to consider the complete $b$-symbol weight distribution of cyclic codes since $b$-symbol metric…

Information Theory · Computer Science 2021-10-05 Hongwei Zhu , Minjia Shi , Ferruh Ozbudak

In this paper, for any odd prime $p$ and an integer $m\ge 3$, several classes of linear codes with $t$-weight $(t=3,5,7)$ are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by…

Information Theory · Computer Science 2022-08-30 Canze Zhu , Qunying Liao

We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are…

Information Theory · Computer Science 2018-01-30 Mrinmoy Datta , Sudhir R. Ghorpade

Cyclic codes have attracted a lot of research interest for decades. In this paper, for an odd prime $p$, we propose a general strategy to compute the complete weight enumerator of cyclic codes via the value distribution of the corresponding…

Information Theory · Computer Science 2016-03-01 Shudi Yang , Zheng-An Yao

The duals of cyclic codes with two zeros have been extensively studied, and their weight distributions have recently been evaluated in some cases. In this note, we determine the weight distribution of a certain new class of such codes by…

Combinatorics · Mathematics 2012-06-18 Tao Feng , Koji Momihara

The weight distribution and weight hierarchy of linear codes are two important research topics in coding theory. In this paper, by choosing proper defining sets from inhomogeneous quadratic functions over $\mathbb{F}_{q}^{2},$ we construct…

Information Theory · Computer Science 2022-06-17 Fei Li , Xiumei Li

An explicit formula for a weight enumerator of linear-congruence codes is provided. This extends the work of Bibak and Milenkovic [IEEE ISIT (2018) 431-435] addressing the binary case to the non-binary case. Furthermore, the extension…

Information Theory · Computer Science 2020-10-05 Taro Sakurai

Cyclic codes with two zeros and their dual codes as a practically and theoretically interesting class of linear codes, have been studied for many years. However, the weight distributions of cyclic codes are difficult to determine. From…

Information Theory · Computer Science 2015-03-19 Baocheng Wang , Chunming Tang , Yanfeng Qi , Yixian Yang , Maozhi Xu

In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…

Information Theory · Computer Science 2021-07-07 Canze Zhu , Qunying Liao

In this paper, we construct two generalized cyclotomic binary sequences of period $2p^{m}$ based on the generalized cyclotomy and compute their linear complexity, showing that they are of high linear complexity when $m\geq 2$.

Information Theory · Computer Science 2018-08-27 Yi Ouyang , Xianhong Xie

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

In this work, we determine new linear equations for the weight distribution of linear codes over finite chain rings. The identities are determined by counting the number of some special submatrices of the parity-check matrix of the code.…

Information Theory · Computer Science 2022-10-31 Giulia Cavicchioni , Alessio Meneghetti

In this manuscript, we construct a class of projective three-weight linear codes and two classes of projective four-weight linear codes over F2 from the defining sets construction, and determine their weight distributions by using additive…

Information Theory · Computer Science 2025-11-04 Qunying Liao , Zhaohui Zhang , Peipei Zheng

We present a family of reducible cyclic codes constructed as the direct sum of two different semiprimitive two-weight irreducible cyclic codes. This family generalizes the class of reducible cyclic codes that was reported in the main result…

Information Theory · Computer Science 2015-08-10 Gerardo Vega

Recently, there has been intensive research on the weight distributions of cyclic codes. In this paper, we compute the weight distributions of three classes of cyclic codes with Niho exponents. More specifically, we obtain two classes of…

Information Theory · Computer Science 2014-01-10 Shuxing Li , Tao Feng , Gennian Ge

We consider the notion of a $(q,m)$-polymatroid, due to Shiromoto, and the more general notion of $(q,m)$-demi-polymatroid, and show how generalized weights can be defined for them. Further, we establish a duality for these weights…

Information Theory · Computer Science 2019-05-28 Sudhir R. Ghorpade , Trygve Johnsen
‹ Prev 1 3 4 5 6 7 10 Next ›