Three Classes of Linear Codes Based on Weil Sums
-
Abstract
In recent years, linear codes with few weights have been extensively studied. Linear codes with few weights are applied in such fields as strongly regular graphs, secret sharing schemes, association schemes and authentication codes. In this paper, a specific defining set is first selected. Based on this, three classes of 6-weight linear codes over finite fields are constructed. Finally, their weight distributions are characterized by using Weil sums.
-
-