Constructions of linear codes with two or three weights from vectorial dual-bent functions (Q6041565): Difference between revisions

Vectorial dual-bent functions, which were introduced in [\textit{A. Çeşmelioğlu} et al., Linear Algebra Appl. 548, 305--320 (2018; Zbl 1391.94862)], turned out to have strong connections to several objects related to combinatorics. In [\textit{J. Wang} et al., IEEE Trans. Inform. Theory, 69, No. 11, 7414--7425 (2023, \url{doi:10.1109/TIT.2023.3295099})], connections between some classes of vectorial dual-bent functions and bent partitions [\textit{N. Anbar} and \textit{W. Meidl}, Des. Codes Cryptography 90, No. 4, 1081--1101 (2022; Zbl 1492.94236)] are shown, which again are connected with partial difference sets and association schemes, see [\textit{N. Anbar} et al., Discrete. Math. 347, No. 1, Paper No. 113658, 13 p. (2024; \url{doi:10.1016/j.disc.2023.113658})]. In this article, linear codes with three weights, and three variants of linear codes with two weights are constructed from vectorial dual-bent functions. The weight distribution for these codes is given explicitly. For all codes, the authors also point to applications in secret sharing. In particular, some results on minimal access sets for secret sharing schemes based on these codes are given.