On binomial Weil sums and an application (Q6950840)

This paper investigates the properties and applications of specific binomial Weil sums denoted by\N\[\NS_N(a, b) := \sum_{x \in \mathbb{F}_q^*} \chi\left(ax^{\frac{q-1}{N}} + bx\right),\N\]\Ndefined over the finite field \(\mathbb{F}_q\) with \(q = p^{\mathrm{ord}_N(p)}\). The study focuses on the specific setting where \(p\) is an odd prime and \(N\) is a positive integer such that \(p\) is a primitive root modulo \(N\) (i.e., \(\mathrm{ord}_N(p) = \phi(N)\)).\N\NThe main contributions of the paper are twofold:\N\N\begin{itemize}\N\item[1.] Evaluation of Weil sums: Inspired by the methods in \textit{M. Moisio} [Finite Fields Appl. 15, No. 6, 644--651 (2009; Zbl 1221.11234)], the authors derive an explicit evaluation of \(S_N(a, b)\) for any odd prime \(p\) and integer \(N\) satisfying the primitive root condition. This approach yields an efficient algorithm for computing these sums, utilizing the representation coefficients of terms related to \(a\) and \(b\) over a power basis of the extension \(\mathbb{F}_q / \mathbb{F}_p\).\N\item[2.] Construction of linear codes: Motivated by \textit{Q. Wang} et al. [IEEE Commun. Lett. 19, 1097--1100 (2015)], the paper applies the aforementioned evaluations to coding theory. The authors construct a family of two-weight linear codes, determining their weight distributions explicitly via the values of \(S_N(a, b)\). Furthermore, the dual codes are analyzed and proven to be optimal. These codes possess potential applications in secret sharing schemes, authentication codes, and combinatorial designs.\N\end{itemize}