Construction of A Class of Minimal Linear Codes

Minimal linear codes are a special subclass of linear codes and have significant applications in secret sharing and secure two-party computation. In this paper, based on the relationship of the defining set and the Walsh spectrum of its characteristic functions, the authors obtain a class of linear codes with a few weights and present the weight distribution. Results show that almost all the new codes obtained in this paper are minimal codes, which can be used to design a secret sharing scheme with good access structure as they are fail to match the A-B condition.