Abstract
Linear codes with a few weights have been extensively studied due to their wide applications in secret sharing schemes, strongly regular graphs, association schemes, and authentication codes. In this paper, we choose the defining sets from two distinct weakly regular plateaued balanced functions, based on a generic construction of linear codes. Then we construct a family of linear codes with at most five nonzero weights. Their minimality is also examined and the result shows that our codes are helpful in secret sharing schemes.
MSC:
94B15; 14G50; 11T23
1. Introduction
Throughout this paper, we will denote by a finite field with p elements, where p is an odd prime. An linear code C of length n over is a k-dimensional linear subspace of with Hamming distance d. The Hamming weight of a codeword is defined by . Let be the number of codewords with weight w in C. By the weight distribution of C, we mean the sequence . The code C is called t-weight if the number of nonzero in the sequence equals t. The weight distribution contains important information about the codes including the capabilities of error detection and correction. In recent years, many interesting articles have been published on good linear codes [1,2,3,4,5,6,7,8,9,10,11,12,13]. Besides, many linear codes with a few weights have been constructed from certain special functions, such as square functions [14], Boolean functions [1] and bent functions [8,15,16,17]. Among them, the plateaued functions, introduced by Zheng et al. in [18], have become one of the most attractive functions recently. The authors in [7,9,10,19] have given several families of linear codes using various weakly regular plateaued functions.
There are several methods to construct linear codes, and one of them goes back to the work of Ding et al. [20]. Let for a positive integer m, and . A class of linear codes over is defined by
where is the trace function from to defined by for . Here D is called the defining set of . Many good linear codes have been derived from this generic approach [3,4,5,9,16,21]. For instance, Sınak et al. [9] constructed a family of linear codes by the defining set:
where f is a weakly regular s-plateaued balanced function.
As one of the generalizations of [20], Li et al. [22] defined a p-ary linear code by
where is also called a defining set. Based on this method, the authors in [2,6,10,11,12,13,17] constructed various linear codes from distinct defining sets. In particular, Cheng et al. in [2] introduced several linear codes of (1) with a few weights by the defining sets:
where f and g are weakly regular s-plateaued unbalanced functions, (resp. ) represents the set of square (resp. non-square) elements in . Later, Sınak et al. [10] constructed new linear codes from an extended defining set D of (2) by considering f and g to be weakly regular s-plateaued and t-plateaued functions, respectively. Inspired by the idea in [2,10], we choose a new defining set
where f and g are weakly regular s-plateaued and t-plateaued balanced functions, respectively. In this paper, we will investigate the linear codes of (1) and determine their parameters and weight distributions using Walsh transform. In fact, as a generalization of [9], the codes we construct will partially extend the results of [2,10].
The rest of this paper is arranged as follows. A summary of weakly regular plateaued functions is presented in Section 2. Section 3 introduces some exponential sums, which will be employed in the subsequent sections. The main results about linear codes are given in Section 4, where we investigate the weight distributions of the codes. Section 5 illustrates the minimality and applications of these codes. Finally, in Section 6 we conclude the paper.
2. Mathematical Foundation
In this section, we will introduce some necessary tools about cyclotomic fields and weakly regular plateaued functions. Firstly, some notations are fixed.
- (1)
- , where p is an odd prime and m is a positive integer;
- (2)
- (resp. ) represents the set of square (resp. non-square) elements in ;
- (3)
- is a primitive p-th root of unity;
- (4)
- is the trace function from to ;
- (5)
- is the quadratic character of ;
- (6)
- and hence .
2.1. Cyclotomic Fields
A cyclotomic field is established from the rational field by adjoining . We call K the p-th cyclotomic field over . Actually, the field K is the splitting field of , and K is a simple algebraic extension of as stated in Theorem 2.47 of [23]. We employ to stand for the field extension of K over .
Lemma 1
([24]). Let K be the p-th cyclotomic field over . Then we have the following results.
- (1)
- The ring of integers in K is , where is the ring of integers, and is an integer basis of .
- (2)
- The field extension is Galois of degree , and the Galois group , where the automorphism of K is defined as .
- (3)
- The cyclotomic field K has a unique quadratic subfield . For , .
By Lemma 1, for any and , we have and .
2.2. Weakly Regular Plateaued Functions
In this subsection, we will introduce some properties of weakly regular functions. Let f be a p-ary function from to . The Walsh transform (see Page 73 of [25]) of f on is defined as a complex-valued function on ,
A function f is said to be balanced over if f takes every element of the same number of pre-images. Otherwise, it is unbalanced. Clearly, f is balanced if and only if .
Bent functions are the ones satisfying . For a bent function f, if for every and some p-ary function g, then f is called regular bent. On the other hand, f is weakly regular bent if there exists a complex number u with and a p-ary function g such that for all . The function g is also weakly regular bent.
As an extension of bent functions, Zheng et al. [18] firstly introduced the notion of plateaued functions in characteristic 2. It was later extended again by Mesnager [15] in any odd characteristic p. A function f is called s-plateaued if for every , where s is an integer with . It is worth noting that every bent function is 0-plateaued. The Walsh support of an s-plateaued f is defined by
By the Parseval identity, we have , which verifies the following lemma.
Lemma 2
(Lemma 1, [15]). Let f be an s-plateaued function. Then for , takes times the value and times the value 0.
The notion of weakly regular s-plateaued functions is due to Mesnager et al. [19].
Definition 1
([19]). Let f be an s-plateaued function, where . Then, f is called weakly regular s-plateaued if there exists a complex number u with , such that
for all , with g being a p-ary function over and for all . Otherwise, f is called non-weakly regular s-plateaued. Note that a weakly regular f is said to be regular if . Moreover, if a weakly regular s-plateaued function f satisfies (resp. ), then f is said to be weakly regular s-plateaued balanced (resp. unbalanced).
Lemma 3
(Lemma 5, [19]). Let and f be a weakly regular s-plateaued function. For every we have
where is the sign of and is a p-ary function over with for all .
In the literature, two subclasses of weakly regular plateaued functions were introduced by setting two homogeneous conditions. Let f be a weakly regular s-plateaued function, where , and let WRPB (resp. WRP) denote the class of these balanced (resp. unbalanced) functions that meet the following two homogeneous conditions:
- (1)
- ;
- (2)
- There exists an even positive integer with , such that for any and .
Remark 1.
For every WRPB (resp. WRP), we have (resp. ).
The classical work on weakly regular s-plateaued functions was presented by Mesnager et al. [7] and Sınak [9].
Lemma 4
(Lemma 6, [7] and Lemma 4, [9]). Let and or with . Then, for every , if , otherwise, .
Lemma 5
(Propositions 2 and 3, [7] and Lemma 5, [9]). Let and or with for every . Then
- (1)
- ;
- (2)
- We have for any and , where is an even positive integer with .
Lemma 6
(Lemma 4, [7]). Let f be a weakly regular s-plateaued function. Then for ,
where is the sign of and is a p-ary function over with for all .
Lemma 7
(Lemma 10, [7]). Let f be a weakly regular s-plateaued function with for every . For , define
When is even, we have
Otherwise,
3. Exponential Sums Associated with Functions in WRPB
In this section, we will present auxiliary results on exponential sums related to weakly regular plateaued balanced functions. These results are very useful in the subsequent sections.
Lemma 8
([23]). For any , we have
- (1)
- (2)
- (3)
- (4)
- .
Lemma 9.
Assume that or with for every . For , we define
When is even, we have
Otherwise, we have
Proof.
For , we define
Note that
From Lemmas 2 and 8, we obtain
On the other hand, from Lemmas 6 and 8, we have
Lemma 10
(Lemma 3.12, [10]). Assume or with and for every and every , respectively. Let
Then we have
Lemma 11.
Assume or with and for every and every , respectively. For , define
When is even, we have
Otherwise,
Proof.
Let . It is obvious that
We define an exponential sum
It is evident by definition that
On the other hand, it follows from Lemmas 6 and 8 that
Combining Lemma 10 and the fact that
we obtain the desired assertion. □
Lemma 12.
Assume or with and for every and every , respectively. For , define
When is even, we get
Otherwise,
Proof.
Obviously,
Let us define an exponential sum
Clearly,
By a similar procedure as we have done in the proof of Lemma 11, we have
Using Lemma 10 and the fact that
we complete the proof of this lemma. □
4. Main Results
Before we go any further, we make the following assumptions for the remainder of the paper. Assume that with and , where and for every and every , respectively. Here and are defined by Lemma 5 satisfying and , where , and . In order to determine the weight distributions of , we define
where and .
4.1. The Determination of
In fact, the value was investigated in [10]. Now we only dedicate ourselves to exploring the case that . We shall determine the values of of (6) for in Lemmas 13 and 14. Without loss of generality, when , we only consider the case that and .
Lemma 13.
Suppose that is even, and . Then, if , we always have , and if , we have the following cases. When ,
When ,
Otherwise, when and ,
Proof.
Let . By definition and the orthogonal property of characters,
where
Now let us determine . It follows that
When , from Lemma 4, we deduce that for . Then one easily checks
When , again from Lemma 4, we see that for . The valuation of is considered naturally under three cases of , and , respectively.
- (1)
- The first case is that . From Lemma 5,
- (2)
- The second case is that . Again from Lemma 5,
- (3)
- The last case is that and . From Lemma 5,
Hence, we obtain the desired assertion from (7). □
Lemma 14.
Suppose that is odd, and . Then, if , we always have , and if , we have the following cases. When , we have
When ,
Otherwise, when and ,
Proof.
(1) The first case we consider is that . Then
(2) The second case is that . Now we have
(3) The last case is that and . Then we deduce that
So, we obtain the conclusion from (7), completing the proof. □
4.2. Weight Distributions of
Recall that
where and , and a class of linear codes are defined by
The length of these linear codes equals the size of . So it is determined by
For the weight distributions of , where , we have the following two theorems.
Theorem 1.
Let be even and , the code be defined by (9) and (10). If , then is a three-weight linear code with weight distribution listed in Table 1. If , then is a three-weight linear code with weight distribution listed in Table 2. Otherwise, if and , then is a five-weight linear code with weight distribution listed in Table 3. For abbreviation, we write , , and
where and .
Table 1.
The weight distribution of when and .
Table 2.
The weight distribution of when and .
Table 3.
The weight distribution of when , and .
Proof.
For , the length of is . Let and the weight of nonzero codeword be denoted by . Then we obviously have that
where is given by Lemma 13. Precisely, when , we have
and the number of such codewords is , according to Lemma 2. Furthermore, when , there are three different cases.
The first case is that . Then it follows from Lemma 13 that
where , and is computed in Lemma 10. This gives the weight distribution in Table 1.
The second case is that . In this case, it follows from Lemma 13 again that
where , and is computed in Lemma 11. We thus get the weight distribution in Table 2.
Finally, we consider the third case that and . By Lemma 13 again, we have
where . The multiplicity of each nonzero weight comes from Lemmas 7 and 9, namely,
where and . The weight distribution is summarized in Table 3. □
Theorem 2.
Let be odd, and the code be defined by (9) and (10). If , then is a three-weight linear code with weight distribution listed in Table 4. If , then is a three-weight linear code with weight distribution listed in Table 5. If , , then is a five-weight linear code with weight distribution listed in Table 6. For briefness, we set , and
where and .
Table 4.
The weight distribution of when and .
Table 5.
The weight distribution of when and .
Table 6.
The weight distribution of when , and .
Proof.
Let and . The weight of nonzero codeword is given by
where and is computed in Lemma 14. According to Lemma 14, when , three distinct cases shall be distinguished.
For the first case , it follows from Lemma 14 that
where , and are computed in Lemma 12. From the above arguments, we obatain the conlusion given in Table 4.
For the second case , it follows from Lemma 13 again that
where , and and are computed in Lemmas 10 and 11, respectively. This yields the weight distribution in Table 5.
Finally, for the third case and , by Lemma 13 again, we have
where . The multiplicity can be determined from Lemmas 7 and 9, namely,
where and . This gives the weight distribution in Table 6. □
5. Minimality of the Codes and Their Applications
In 1979, Shamir [26] and Blakley [27] introduced the notion of secret sharing schemes. Since then, secret sharing schemes have become an important application of linear codes. In recent years, secret sharing schemes have been widely used in cloud environments, banking systems, electronic voting systems and so on.
Any linear code can be employed to construct secret sharing schemes by considering the access structure. However, the access structure based on a linear code is very complicated, and only can be determined in several special cases. One of these cases is that each codeword of the code is minimal.
If a nonzero codeword of a linear code C solely covers its scalar multiples, but no other nonzero codewords, then it is called a minimal codeword. The code C is said to be minimal if each nonzero codeword of C is minimal.
It is naturally difficult to find minimal codes by definition. Fortunately, in 1998, Ashikhmin and Barg [28] provided simple criteria to determine whether a given linear code is minimal.
Lemma 15
(Ashikhmin-Barg Bound [28]). Let C be a linear code over . Then all nonzero codewords of C are minimal, provided that
where and stand for the minimum and maximum nonzero weights in C, respectively.
Now we will show under what circumstances the linear codes constructed in this paper are minimal. The following theorem is verified directly according to Lemma 15.
Theorem 3.
Under the framework [29], the minimal codes in Theorem 3 can be applied to construct secret sharing schemes with good access structures. An example is showed in detail in the following.
Theorem 4
(Proposition 2, [29]). 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.
Now, we take the code described in Table 1 as an example. If we take , , and , then has length and dimension . From Table 1, the weight enumerator of is . The code is minimal due to Theorem 3. Note that the minimum distance of its dual code is . According to Theorem 4, we get the following theorem.
Theorem 5.
Let , , and and be the generator matrix of the code described in Table 1. Then in the secret sharing scheme 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 and is a dictatorial participant.
- (2)
- If is not a multiple of , , then participant must be in out of minimal access sets.
6. Conclusions
The paper studied the construction of linear codes from two weakly regular s-plateaued and t-plateaued balanced functions. Hence, this was an extension of the results in [2] and [10]. Additionally, because of the minimality, the codes we constructed are suitable for secret sharing schemes. However, no one finds an example of weakly regular plateaued balanced functions in the set . It would be desirable to find such a function, but we have not been able to do this.
Author Contributions
Conceptualization, S.Y. and T.Z.; methodology, S.Y.; validation, S.Y., T.Z. and P.L.; writing—original draft preparation, T.Z.; writing—review and editing, S.Y. and T.Z.; visualization, P.L.; supervision, S.Y. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by National Natural Science Foundation of China (No. 12071247), Research and Innovation Fund for Graduate Dissertations of Qufu Normal University (No. LWCXS202251), and Natural Science Foundation of Guangdong Province, China (No. 2021A1515011607).
Conflicts of Interest
The authors declare no conflict of interest.
References
- Chen, H.; Ding, C.S.; Mesnager, S.; Tang, C.M. A novel application of Boolean functions with high algebraic immunity in minimal codes. IEEE Trans. Inf. Theory 2021, 67, 6856–6867. [Google Scholar] [CrossRef]
- Cheng, Y.J.; Cao, X.W. Linear codes with few weights from weakly regular plateaued functions. Discret. Math. 2021, 344, 112597. [Google Scholar] [CrossRef]
- Heng, Z.L.; Ding, C.S.; Zhou, Z.C. Minimal linear codes over finite fields. Finite Fields Their Appl. 2018, 54, 176–196. [Google Scholar] [CrossRef]
- Heng, Z.L.; Li, D.X.; Du, J.; Chen, F.L. A family of projective two-weight linear codes. Des. Codes Cryptogr. 2021, 89, 1993–2007. [Google Scholar] [CrossRef]
- Kong, X.L.; Yang, S.D. Complete weight enumerators of a class of linear codes with two or three weights. Discret. Math. 2019, 342, 3166–3176. [Google Scholar] [CrossRef]
- Lu, H.; Yang, S.D. Two classes of linear codes from Weil sums. IEEE Access 2020, 8, 180471–180480. [Google Scholar] [CrossRef]
- Mesnager, S.; Sınak, A. Several classes of minimal linear codes with few weights from weakly regular plateaued functions. IEEE Trans. Inf. Theory 2020, 66, 2296–2310. [Google Scholar] [CrossRef]
- Özbudak, F.; Pelen, R.M. Two or three weight linear codes from non-weakly regular bent functions. IEEE Trans. Inf. Theory 2022, 68, 3014–3027. [Google Scholar] [CrossRef]
- Sınak, A. Minimal linear codes from weakly regular plateaued balanced functions. Discret. Math. 2021, 344, 112215. [Google Scholar] [CrossRef]
- Sınak, A. Construction of minimal linear codes with few weights from weakly regular plateaued functions. Turk. J. Math. 2022, 46, 953–972. [Google Scholar] [CrossRef]
- Yang, S.D. Complete weight enumerators of linear codes based on Weil sums. IEEE Commun. Lett. 2021, 25, 346–350. [Google Scholar] [CrossRef]
- Zhang, T.H.; Lu, H.; Yang, S.D. Two-weight and three-weight linear codes constructed from Weil sums. Math. Found. Comput. 2022, 5, 129–144. [Google Scholar] [CrossRef]
- Zheng, D.B.; Zhao, Q.; Wang, X.Q.; Zhang, Y. A class of two or three weights linear codes and their complete weight enumerators. Discret. Math. 2021, 344, 112355. [Google Scholar] [CrossRef]
- Tang, C.M.; Qi, Y.F.; Huang, D.M. Two-weight and three-weight linear codes from square functions. IEEE Commun. Lett. 2016, 20, 29–32. [Google Scholar] [CrossRef]
- Mesnager, S. Characterizations of plateaued and bent functions in characteristic p. In Proceedings of the International Conference on Sequences and their Applications, SETA—2014, Melbourne, VIC, Australia, 24–28 November 2014; Springer: Cham, Switzerland, 2014; pp. 72–82. [Google Scholar]
- Tang, C.M.; Li, N.; Qi, Y.F.; Zhou, Z.C.; Helleseth, T. Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 2016, 62, 1166–1176. [Google Scholar] [CrossRef]
- Wu, Y.N.; Li, N.; Zeng, X.Y. Linear codes with few weights from cyclotomic classes and weakly regular bent functions. Des. Codes Cryptogr. 2020, 88, 1255–1272. [Google Scholar] [CrossRef]
- Zheng, Y.L.; Zhang, X.M. Plateaued functions. In Proceedings of the International Conference on Information and Communications Security, Sydney, NSW, Australia, 9–11 November 1999; Springer: New York, NY, USA, 1999; pp. 284–300. [Google Scholar]
- Mesnager, S.; Özbudak, F.; Sınak, A. Linear codes from weakly regular plateaued functions and their secret sharing schemes. Des. Codes Cryptogr. 2019, 87, 463–480. [Google Scholar] [CrossRef]
- Ding, C.S.; Niederreiter, H. Cyclotomic linear codes of order 3. IEEE Trans. Inf. Theory 2007, 53, 2274–2277. [Google Scholar] [CrossRef]
- Luo, G.J.; Ling, S. Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes. Des. Codes Cryptogr. 2022, 90, 1271–1287. [Google Scholar] [CrossRef]
- Li, C.J.; Yue, Q.; Fu, F.W. A construction of several classes of two-weight and three-weight linear codes. Appl. Algebra Eng. Commun. Comput. 2017, 28, 11–30. [Google Scholar] [CrossRef]
- Lidl, R.; Niederreiter, H. Finite Fields; Cambridge University Press: Cambridge, UK, 1997. [Google Scholar]
- Ireland, K.; Rosen, M. A Classical Introduction to Modern Number Theory; Springer: New York, NY, USA, 1990. [Google Scholar]
- Mesnager, S. Bent Functions: Fundamentals and Results; Springer: Cham, Switzerland, 2016. [Google Scholar]
- Shamir, A. How to share a secret. Commun. ACM 1979, 22, 612–613. [Google Scholar] [CrossRef]
- Blakley, G.R. Safeguarding cryptographic keys. In Proceedings of the International Workshop on Managing Requirements Knowledge (MARK), New York, NY, USA, 4–7 June 1979; Springer: New York, NY, USA, 1979; pp. 313–317. [Google Scholar]
- Ashikhmin, A.; Barg, A. Minimal vectors in linear codes. IEEE Trans. Inf. Theory 1998, 44, 2010–2017. [Google Scholar] [CrossRef]
- Yuan, J.; Ding, C.S. Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 2006, 52, 206–212. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).