Related papers: Generalized Hamming weights of three classes of li…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
We explicitly determine all the relative generalized Hamming weights of affine Cartesian codes using the notion of footprints and results from extremal combinatorics. This generalizes the previous works on the determination of relative…
A weighted Hamming metric is introduced in [4] and it showed that the binary generalized Goppa code is a perfect code in some weighted Hamming metric. In this paper, we study the weight structures which admit the binary Hamming code and the…
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…
Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes -- the generalized covering radius. The generalized covering-radius hierarchy of a…
It was recently shown that RGHW (relative generalized Hamming weight) exactly expresses the security of linear ramp secret sharing scheme. In this paper we determine the true value of the asymptotic metric for RGHW previously proposed by…
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…
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.…
In $1991$, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei's duality theorem has since been extensively studied from different…
Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…
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…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…
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…
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…
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…
In this paper, a class of two-weight and three-weight linear codes over $\gf(p)$ is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain…
In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…
Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems due to their efficient encoding and decoding algorithms. Cyclic codes with many zeros and their…
Linear codes can be employed to construct authentication codes, which is an interesting area of cryptography. The parameters of the authentication codes depend on the complete weight enumerator of the underlying linear codes. In order to…