Construction of two classes of minimal binary linear codes based on Boolean function

抄録

Linear codes with a few-weight have important applications in combinatorial design, strongly regular graphs and cryptography. In this paper, we first construct a class of Boolean functions with at most five-valued Walsh spectra, and determine their spectrum distribution. Then, we derive two classes of linear codes with at most six-weight from the new functions. Meanwhile, the length, dimension and weight distributions of the codes are obtained. Results show that both of the new codes are minimal and among them, one is the wide minimal code and the other is narrow minimal code and thus can be used to design secret sharing scheme with good access structures. Finally, magma program is used to verify the correctness of our results.