Complete weight enumerators of few-weight linear codes

Few-weight linear codes have important applications in the construction of strongly regular graphs, authentication codes and secret sharing schemes. In this paper, some few-weight linear codes are constructed from proper defining sets over finite fields. Their complete weight enumerators are explicitly determined using Weil sums. As applications, we give two classes of new projective three-weight linear codes, which achieve the Griesmer bound. We construct some new strongly regular graphs and infinite families of minimal three-weight linear codes with wminwmax <= p-1p\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\frac{w_{min}}{w_{max}}\le \frac{p-1}{p}$$\end{document}. Moreover, some new authentication codes are presented. Our results generalize and improve the work of Zhu and Liao (Finite Fields Appl. 75, 101897, 2021).