Related papers: Relative Generalized Hamming Weights of Cyclic Cod…
We provide a comprehensive overview of the fundamental structural properties of weighted projective Reed-Muller codes. We give a recursive construction for these codes, under some conditions for the weights, and we use it to derive bounds…
We study the generalized rank weight distribution of a linear code. First, we provide a MacWilliams-type identity which relates the distributions of a code and its dual. Then, we give a formula for the enumerator polynomial. Finally, we…
In this paper we extend the works \cite{gegeng2,XLZD} further in two directions and compute the weight distribution of these cyclic codes under more relaxed conditions. It is interesting to note that many cyclic codes in the family are…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we solve one more special case. The problem of finding the weight distribution is transformed into a…
Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…
The aim of this work is to give degree formulas for the generalized Hamming weights of evaluation codes and to show lower bounds for these weights. In particular, we give degree formulas for the generalized Hamming weights of…
Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…
Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights…
Let $G$ be a connected graph and let $\mathbb{X}$ be the set of projective points defined by the column vectors of the incidence matrix of $G$ over a field $K$ of any characteristic. We determine the generalized Hamming weights of the…
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.…
There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…
We generalize the Brouwer-Zimmermann algorithm, which is the most efficient general algorithm for computing the minimum distance of a random linear code, to the case of generalized Hamming weights. We also adapt this algorithm to compute…
Universal security over a network with linear network coding has been intensively studied. However, previous linear codes used for this purpose were linear over a larger field than that used on the network. In this work, we introduce new…
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.…
Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan \cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information…
Linear codes have diverse applications in secret sharing schemes, secure two-party computation, association schemes, strongly regular graphs, authentication codes and communication. There are a large number of linear codes with few weights…
Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some advantages…
It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based…