Related papers: Binary linear codes with few weights from two-to-o…
Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm Tr}(af(x)+bx)_{x \in \mathbb{F}_{q^m}^*}: a,b \in…
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…
The linear codes with a few weights have been applied widely in combinatorial designs, secret sharing, association schemes, authentication codes and strongly regular graphs. In this paper, we first correct an erroneous result about the…
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…
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…
Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do…
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…
Three classes of binary linear codes with at most four nonzero weights were constructed in this paper, in which two of them are projective three-weight codes. As applications, $s$-sum sets for any odd $ s > 1$ were constructed.
Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions or plateaued Boolean functions, we construct a family of…
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…
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…
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
In this article we present a class of codes with few weights arising from special type of linear sets. We explicitly show the weights of such codes, their weight enumerator and possible choices for their generator matrices. In particular,…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…
A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…
Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters…
It is well-known that few-weight linear codes have better applications in secret sharing schemes \cite{JY2006,CC2005}.In particular, projective two-weight codes are very precious as they are closely related to finite projective spaces,…
We first establish a simple yet powerful necessary and sufficient condition for a binary linear code to be SO, leading to a complete characterization of singly-even codes in this family. We further derive necessary and sufficient conditions…
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…