Weight distributions of two classes of linear codes with few weights derived from Weil sums
This work provides new families of few-weight linear codes with optimal parameters for coding theory researchers, but the construction is incremental as it extends known techniques using Weil sums.
The authors construct two classes of p-ary linear codes with few nonzero weights (two, four, six, eight, or nine) by selecting specific defining sets, and completely determine their weight distributions using Weil sums. They obtain an infinite family of two-weight optimal linear codes meeting the Griesmer bound and observe that some codes are minimal under certain conditions.
Linear codes with few weights have been a subject of study for many years, as they have applications in secret sharing, authentication codes, association schemes, and strongly regular graphs. In this article, two distinct classes of $p$-ary linear codes are constructed through the selection of two specific defining sets. Their weight distributions are completely determined for each case by detailed calculations on certain Weil sums. The constructed codes are shown to have only two, four, six, eight, and nine nonzero weights under different cases. In particular, we obtained an infinite family of two-weight optimal linear codes with respect to the Griesmer bound. Moreover, we observe that some of our newly constructed codes are minimal under certain conditions.