Linear Codes from Two Weakly Regular Plateaued Balanced Functions
Abstract
:1. Introduction
2. Mathematical Foundation
- (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
- (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 , .
2.2. Weakly Regular Plateaued Functions
- (1)
- ;
- (2)
- There exists an even positive integer with , such that for any and .
- (1)
- ;
- (2)
- We have for any and , where is an even positive integer with .
3. Exponential Sums Associated with Functions in WRPB
- (1)
- (2)
- (3)
- (4)
- .
4. Main Results
4.1. The Determination of
- (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,
4.2. Weight Distributions of
5. Minimality of the Codes and Their Applications
- (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.
- (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
Author Contributions
Funding
Conflicts 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] [Green Version]
- 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] [Green Version]
- 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] [Green Version]
- Ö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] [Green Version]
- 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]
Weight | Multiplicity |
---|---|
0 | 1 |
Weight | Multiplicity |
---|---|
0 | 1 |
Weight | Multiplicity |
---|---|
0 | 1 |
Weight | Multiplicity |
---|---|
0 | 1 |
Weight | Multiplicity |
---|---|
0 | 1 |
Weight | Multiplicity |
---|---|
0 | 1 |
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/).
Share and Cite
Yang, S.; Zhang, T.; Li, P. Linear Codes from Two Weakly Regular Plateaued Balanced Functions. Entropy 2023, 25, 369. https://doi.org/10.3390/e25020369
Yang S, Zhang T, Li P. Linear Codes from Two Weakly Regular Plateaued Balanced Functions. Entropy. 2023; 25(2):369. https://doi.org/10.3390/e25020369
Chicago/Turabian StyleYang, Shudi, Tonghui Zhang, and Ping Li. 2023. "Linear Codes from Two Weakly Regular Plateaued Balanced Functions" Entropy 25, no. 2: 369. https://doi.org/10.3390/e25020369