Abstract:

The construction of (minimal) linear codes from functions over finite fields has been greatly studied in the literature, since determining the parameters of codes based on functions is rather easy due to the nice structures of functions. In this paper, we derive $3$-weight and $4$-weight linear codes from weakly regular plateaued functions in the recent construction method of linear codes over the odd characteristic finite fields. The Hamming weights and weight distributions for codes are, respectively, determined by using the Walsh transform values and Walsh distributions of the employed functions. We also derive projective $3$-weight punctured codes with good parameters from the constructed codes. These punctured codes may be almost optimal due to the Griesmer bound, and they can be employed to design association schemes. We lastly show that all constructed codes are minimal, which approves that they can be employed to design high democratic secret sharing schemes.

Keywords: