Related papers: A construction of $q$-ary linear codes with two we…
Let $\mathbb{F}_{p^m}$ be the finite field of order $p^m$, where $p$ is an odd prime and $m$ is a positive integer. In this paper, we investigate a class of subfield codes of linear codes and obtain the weight distribution of…
In this paper, we consider minimal linear codes in a general construction of linear codes from q-ary functions. First, we give the sufficient and necessary condition for codewords to be minimal. Second, as an application, we present four…
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…
Boolean functions can be used to construct binary linear codes in many ways, and vice versa. The objective of this short article is to point out a connection between the weight distributions of all projective binary linear codes and the…
Using double counting, we prove Delsarte inequalities for $q$-ary codes and their improvements. Applying the same technique to $q$-ary constant-weight codes, we obtain new inequalities for $q$-ary constant-weight codes.
It was shown in \cite{GXY18} that the length $n$ of a $q$-ary linear locally recoverable code with distance $d\ge 5$ is upper bounded by $O(dq^3)$. Thus, it is a challenging problem to construct $q$-ary locally recoverable codes with…
In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we use the method developed before to solve one more special case. We make extensive use of standard…
It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…
Linear codes over finite fields parameterized by functions have proven to be a powerful tool in coding theory, yielding optimal and few-weight codes with significant applications in secret sharing, authentication codes, and association…
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 are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…
Based on a generic construction, two classes of ternary three-weight linear codes are obtained from a family of power functions, including some APN power functions. The weight distributions of these linear codes are determined through…
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Cyclic codes have been studied for many years, but their weight…
Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many…
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 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.
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…
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…