Several classes of linear codes with few weights from the closed butterfly structure (Q2238931)

Linear codes having few weights are an important class of codes as they are closely related to combinatorial designs, finite geometry, and graph theory. Moreover, they have also been used successfully in secret sharing schemes and authentication codes, as the AB condition for the determination of the minimality of the codes is easier to be checked in this case. Several different families of optimal and minimal few-weight linear codes were constructed in literature selecting a proper defining set and using exponential sums, see for example [\textit{G. Jian} et al., Finite Fields Appl. 57, 92--107 (2019; Zbl 1448.94264)]. In this paper, the authors use exponential sums techniques for constructing few-weights codes from butterfly structures, that were introduced in the context of nonlinear functions in [\textit{A. Canteaut} et al., IEEE Trans. Inf. Theory 63, No. 11, 7575--7591 (2017; Zbl 1390.94813)]. Some of these codes are shown to be optimal or minimal.