1. Introduction
Let
p be a prime number and
the finite field with
p elements. We denote
C to be a linear code over
with parameters
, which that means
C is a subspace of dimension
k with minimum distance
d of the vector space
. Compared with nonlinear codes, linear codes are easier to describe, encode and decode, due to their algebraic structure, so they have many applications in cryptography and communications. See [
1] for more information about linear codes.
For a codeword
, its weight is defined by
Then, the weight distribution of
C is the sequence
, where
and
stands for the number of codewords in
C that have weight
w, for
, i.e.,
The code
C is called
t-weight if the number of nonzero
for
equals
t. Linear codes with a few nonzero weights have attracted much attention in recent decades due to their wide applications in theory and practice, see [
2,
3,
4,
5,
6,
7,
8,
9,
10,
11]. Some linear codes are constructed from bent functions [
6,
12], square functions [
13] and weakly regular plateaued functions [
3,
5,
7].
In what follows, we always assume
p is an odd prime. Now, let us introduce an efficient way to construct linear codes, which was proposed by Ding et al. [
14]. Let
and
D be a subset of
of size
n. We define
where
is the absolute trace function. It can be checked that
is a linear code of length
n. The set
D is called the defining set of
. This approach was generalized by Li et al. [
15], who defined a class of codes by
where the defining set
D is a subset of
. Let
. For
p-ary functions
f and
g, we define
Based on [
15], Wu et al. [
16] offered new linear codes using the defining set
, where
f and
g are weakly regular bent functions from
to
. Later, Cheng et al. in [
3] introduced several linear codes
of (
1) with a few weights by considering
f and
g to be weakly regular unbalanced
s-plateaued functions in the defining set
, where
. In 2022, Sınak [
17] went deeper by choosing the weakly regular unbalanced and balanced
-plateaued function
f and
-plateaued function
g in
, where
. Very recently, Yang et al. [
18] continued the research of [
17] by considering two weakly regular balanced plateaued functions in the defining set
, where
. All of them studied the indexes of
f and
g among the set
, that is,
.
Along this research line, we further consider the index of
, where
. Let
f and
g be certain weakly regular unbalanced and balanced
s-plateaued and
t-plateaued functions, respectively, for
. The defining set is denoted by
For clarity, we only concentrate on the case of
and
, since the case of
and
will lead to similar results (also, see Remark 3 for the case of
). In this paper, we consider the constructed codes
of (
1) and (
2). In detail, we will completely determine their weight distributions using the theory of exponential sums and Walsh transform.
The rest of this paper is arranged as follows. We first present, in
Section 2, an introduction to the mathematical foundations.
Section 3 gives necessary results for our computation. Our main results are proposed in
Section 4, where we study the weight distributions and the parameters of our constructed codes and their punctured ones.
Section 5 shows the minimality and applications of these codes. Finally, the whole paper is concluded in
Section 6.
5. Minimality of the Codes and Their Applications
This section is devoted to analyzing the minimality of our codes
defined by (
1) and (
2), and then applying them to construct secret sharing schemes.
A linear code
C over
is called minimal if every nonzero codeword
solely covers its scalar multiples
for
. In 1998, Ashikhmin and Barg [
24] provided a sufficient condition for a linear code to be minimal, that is,
where
and
represent the minimum and maximum nonzero weights, respectively.
Now, we will show the minimality of the constructed linear codes in Theorems 1–3.
Theorem 4. The linear codes with weight distributions in Table 1 and Table 2 are minimal, if . The linear codes with weight distributions in Table 4, Table 5 and Table 6 are minimal, if and , or if and . It should be noted that the minimum distance of
equals 2 since there are two linearly dependent entries in each codeword in
. Additionally, under the framework stated in [
25,
26], the minimal codes described in Theorem 4 can be employed to construct secret sharing schemes with good access structure.
Theorem 5 (Proposition 2, [
26])
. Let C be an code over , and let be its generator matrix. If C is minimal, then in the secret sharing schemes based on the dual code , there are altogether minimal access sets. In addition, we have the following assertions:- (1)
If is a multiple of , , then participant must be in every minimal access set. Such a participant is called a dictatorial participant.
- (2)
If is not a multiple of , , then participant must be in out of minimal access sets.
According to Theorem 5, we give the following example for secret sharing schemes.
Example 4. Let be defined as and . Then, with , and . From Table 6 in Theorem 2, the code is a three-weight code with parameters and the weight enumerator . So, is minimal by Theorem 4. Let be the generator matrix of . Then, in the secret sharing scheme based on the dual code , there are altogether 78,125
minimal access sets. In addition, we have the following assertions: - (1)
If is a multiple of , 90,623, then participant must be in every minimal access set and is a dictatorial participant.
- (2)
If is not a multiple of , 90,623, then participant must be in 62,500 out of 78,125 minimal access sets.
6. Conclusions
In the literature, linear codes from weakly regular plateaued functions with index 2 and
have been extensively studied, where
p is a general prime number, see [
3,
16,
17,
18] and the references therein. However, the index of
has not been considered before. In this paper, we took
and studied the construction of new linear codes from two weakly regular plateaued functions with new indexes 2,
and
. By calculating the exponential sums carefully, we succeeded in determining their weight distributions, as we had described in Theorems 1–3. Moreover, most of our codes are minimal and so they are suitable for designing secret sharing schemes. It should be noted that all the examples we gave are chosen from weakly regular unbalanced plateaued functions. Unfortunately, we have not found any weakly regular balanced plateaued functions until now. It would be very nice if someone found such a function in the future.