English
Related papers

Related papers: Weight Distributions of Hamming Codes

200 papers

In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$. We provide quantitative estimates showing that the distribution function of the minimal…

Information Theory · Computer Science 2020-07-15 Jing Hao , Han Huang , Galyna Livshyts , Konstantin Tikhomirov

Let $q=p^n$ with $n=2m$ and $p$ be an odd prime. Let $0\leq k\leq n-1$ and $k\neq m$. In this paper we determine the value distribution of following exponential(character) sums \[\sum\limits_{x\in \bF_q}\zeta_p^{\Tra_1^m (\alpha…

Information Theory · Computer Science 2009-02-27 Jinquan Luo , Yuansheng Tang , Hongyu Wang

Let $q=2^n$, $0\leq k\leq n-1$, $n/\gcd(n,k)$ be odd and $k\neq n/3, 2n/3$. In this paper the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\mathrm{Tr}_1^n(\alpha x^{2^{2k}+1}+\beta x^{2^k+1}+\ga…

Information Theory · Computer Science 2009-04-16 Jinquan Luo

Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of…

Information Theory · Computer Science 2017-11-15 Minglong Qi , Shengwu Xiong , Jingling Yuan , Wenbi Rao , Luo Zhong

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…

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

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

We consider the $[q+1,q-3,5]_q3$ generalized doubly-extended Reed-Solomon code of codimension $4$ as the code associated with the twisted cubic in the projective space $\mathrm{PG}(3,q)$. Basing on the point-plane incidence matrix of…

Information Theory · Computer Science 2021-02-23 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

In this study, linear codes having their Lee-weight distributions over the semi-local ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$ with $u^{2}=1$ are constructed using the defining set and Gauss sums for an odd prime $q $. Moreover, we derive…

Information Theory · Computer Science 2024-07-08 Pavan Kumar , Noor Mohammad Khan

In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…

Information Theory · Computer Science 2021-06-08 Fei Li

Due to the wide applications in consumer electronics, data storage systems and communication systems, cyclic codes have been an interesting research topic in coding theory. In this paper, let $p$ be a prime with $p\ge 7$. We determine the…

Information Theory · Computer Science 2019-11-21 Xia Li , Qin Yue

Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…

Information Theory · Computer Science 2025-11-25 Dongmei Huang , Qunying Liao , Sihem Mesnager , Gaohua Tang , Haode Yan

Linearized Reed-Solomon codes are defined. Higher weight distribution of those codes are determined.

Information Theory · Computer Science 2015-05-28 Haode Yan , Yan Liu , Chunlei Liu

In this paper, a family of five-weight reducible cyclic codes is presented. Furthermore, the weight distribution of these cyclic codes is determined, which follows from the determination of value distributions of certain exponential sums.

Information Theory · Computer Science 2015-02-13 Yan Liu , Haode Yan

The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…

Information Theory · Computer Science 2015-04-07 Maosheng Xiong , Shuxing Li , Gennian Ge

In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over $\mathbb{F}_p$ are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums.…

Information Theory · Computer Science 2024-12-19 Xina Zhang

Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate…

Information Theory · Computer Science 2015-02-04 Olav Geil , Stefano Martin , Ryutaroh Matsumoto , Diego Ruano , Yuan Luo

Recently, Andrews, Chan, Kim and Osburn introduced a $q$-series $h(q)$ for the study of the first positive rank and crank moments for overpartitions. They conjectured that for all integers $m \geq 3$, \begin{equation*}\label{hqcon}…

Number Theory · Mathematics 2016-05-31 Xinhua Xiong

The second weight of the Generalized Reed-Muller code of order $d$ over the finite field with $q$ elements is now known for $d <q$ and $d>(n-1)(q-1)$. In this paper, we determine the second weight for the other values of $d$ which are not…

Information Theory · Computer Science 2009-06-30 Robert Rolland

Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…

Information Theory · Computer Science 2024-10-04 Xiumei Li , Zongxi Chen , Fei Li

In this paper, we characterize the average Hamming weight distribution of subsequences of maximum-length sequences ($m$-sequences). In particular, we consider all possible $m$-sequences of dimension $k$ and find the average number of…

Information Theory · Computer Science 2021-07-13 Mahyar Shirvanimoghaddam