On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions

In this paper, the weight distributions of two classes of linear codes based on all known explicit perfect nonlinear functions from
Fqm
to itself are determined using a unified approach. All the minimal codewords of these codes are characterized according to their weights, which suggests that their covering structures are determined. Finally, all the minimal access sets of the secret sharing schemes based on their dual codes are obtained.