Minimal linear codes from weakly regular bent functions

Minimal linear codes have received much attention in the past decades due to their important applications in secret sharing schemes and secure two-party computation, etc. Recently, several classes of minimal linear codes with w(min)/w(max) <= (p- 1)/ p have been discovered, where w(min) and w(max) respectively denote the minimum and maximum nonzero weights in a code. In this paper, we investigate the minimality of a class of p-ary linear codes and obtain some sufficient conditions for this kind of linear codes to be minimal, which is a generalization of the recent results given by Xu et al. (Finite Fields Appl. 65,101688, 2020). This allows us to construct new minimal linear codes with w(min)/w(max) <= (p - 1)/ p from weakly regular bent functions for the first time. The parameters of minimal linear codes presented in this paper are different from those known in the literature.