Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions

Abstract

Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many construction methods of linear codes based on functions have been proposed in the literature. In this paper, we generalize the recent construction methods given by Tang et al. in [IEEE Transactions on Information Theory, 62(3), 1166-1176, 2016] to weakly regular plateaued functions over finite fields of odd characteristic. We first construct three weight linear codes from weakly regular plateaued functions based on the second generic construction and determine their weight distributions. We next give a subcode with two or three weights of each constructed code as well as its parameter. We finally show that the constructed codes in this paper are minimal, which confirms that the secret sharing schemes based on their dual codes have the nice access structures.

A geometric characterization of minimal codes and their asymptotic performance

“…In [12], Bonini and Borello investigated the geometric generalization of the construction in [8], highlighting a first link between minimal codes and cutting blocking sets. Moreover, different types of recent constructions of minimal codes based on weakly regular bent and plateaued functions have been also presented in [31,32,33].…”

Strongly Regular Graphs from Weakly Regular Plateaued Functions

“…Proof. We have clearly that D f,sq,0 = D f,sq ∪ D f from (6). Then Hence, the desired parameters follow from Theorems 2 and 3 with the same group ring computations.…”

Some subfield codes from MDS codes

“…Then we have the following results which were proved in [17,20]. 20]) Let m and e be positive integers with gcd(m, e) = 1.…”