Related papers: Computing Symmetrized Weight Enumerators for Lifte…
We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications…
In this paper, for an odd prime power $q$, we extend the construction of Xie et al. \cite{XOYM2023} to propose two classes of linear codes $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$ over the finite field $\mathbb{F}_{q}$ with at most four…
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…
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…
This paper develops an algorithmic approach for obtaining estimates of the weight enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the partition functions of spin systems, which in turn employs a…
In this paper we present a new method for finding the weight enumerator of binary linear block codes by using genetic algorithms. This method consists in finding the binary weight enumerator of the code and its dual and to create from the…
It is well-known that Reed-Solomon codes and extended Reed-Solomon codes are two special classes of MDS codes with wide applications in practice. The complete weight enumerators of these codes are very important for determining the…
A binary linear code is called {\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on…
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…
In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…
In this paper, based on the theory of defining sets, a class of four-weight or five-weight linear codes over Fp is constructed. The complete weight enumerators of the linear codes are determined by means of Weil sums. In some case, there is…
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…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we present the explicit complete weight enumerator of a family of $p$-ary linear codes constructed with defining…
Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set.…
Let $\mathbb{F}_q$ be a finite field of characteristic not equal to $2$ or $3$. We compute the weight enumerators of some projective and affine Reed-Muller codes of order $3$ over $\mathbb{F}_q$. These weight enumerators answer enumerative…
This paper investigates the relation between linear codes and the stabilizer in ${\rm GL}_2(\mathbb{C})$ of their weight enumerators. We prove a result on the finiteness of stabilizers and give a complete classification of linear codes with…
Product codes are widely used in data-storage, optical and wireless applications. Their analytical performance evaluation usually relies on the truncated union bound, which provides a low error rate approximation based on the minimum…
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…
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…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…