Constructions of linear codes with two or three weights from vectorial dual-bent functions

DOI10.1016/J.DISC.2023.113448MaRDI QIDQ6041565zbMATH OpenFDO

Authors Jiaxin Wang, Zexia Shi, Yadi Wei, Fangwei Fu

Publication date 31 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2207.11668

zbMATH Keywords

linear codesecret sharing schemevectorial dual-bent functionweight distribution

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Boolean functions (94D10)

Abstract: Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of $q$-ary linear codes with two or three weights from vectorial dual-bent functions, where $q$ is a power of an odd prime $p$. The weight distributions of the constructed $q$-ary linear codes are completely determined. We illustrate that some known constructions in the literature can be obtained by our constructions. In some special cases, our constructed linear codes can meet the Griesmer bound. Furthermore, based on the constructed $q$-ary linear codes, we obtain secret sharing schemes with interesting access structures.

Review text

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.

Recommendations

• Linear codes with two or three weights from quadratic bent functions
• Binary linear codes from vectorial Boolean functions and their weight distribution
• Linear codes with few weights from weakly regular bent functions based on a generic construction
• Two-weight and three-weight linear codes constructed from Weil sums
• A construction of several classes of two-weight and three-weight linear codes

Cites work

• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• A coding theory construction of new systematic authentication codes
• A construction of q-ary linear codes with two weights
• A construction of binary linear codes from Boolean functions
• A family of projective two-weight linear codes
• Bent and vectorial bent functions, partial difference sets, and strongly regular graphs
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Complete weight enumerators of a family of three-weight linear codes
• Complete weight enumerators of some linear codes from quadratic forms
• Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
• Fundamentals of Error-Correcting Codes
• How to build robust shared control systems
• How to share a secret
• scientific article; zbMATH DE number 3871188 (Why is no real title available?)
• Linear codes from functions
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Linear codes from quadratic forms
• Linear Codes From Some 2-Designs
• Linear codes from weakly regular plateaued functions and their secret sharing schemes
• Linear codes with few weights from cyclotomic classes and weakly regular bent functions
• Linear codes with few weights from inhomogeneous quadratic functions
• Linear codes with few weights from weakly regular bent functions based on a generic construction
• Linear codes with two or three weights from quadratic bent functions
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• Minimal linear codes from weakly regular bent functions
• Minimal vectors in linear codes
• Monomial and quadratic bent functions over the finite fields of odd characteristic
• New results on vectorial dual-bent functions and partial difference sets
• On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions
• Recent results and problems on constructions of linear codes from cryptographic functions
• Secret sharing schemes from three classes of linear codes
• Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
• Shortened Linear Codes From APN and PN Functions
• The Geometry of Two-Weight Codes
• The weight distribution of a class of linear codes from perfect nonlinear functions
• Three classes of linear codes with two or three weights
• Two classes of p-ary bent functions and linear codes with three or four weights
• Two or Three Weight Linear Codes From Non-Weakly Regular Bent Functions
• Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications
• Vectorial bent functions and their duals

Cited in

(7)

• More constructions of 3-weight linear codes
• A construction of q-ary linear codes with two weights
• Linear codes with two or three weights from quadratic bent functions
• Bent vectorial functions and linear codes from o-polynomials
• Two classes of p-ary bent functions and linear codes with three or four weights
• Three Weight Ternary Linear Codes from Non-Weakly Regular Bent Functions
• Linear codes with few weights from vectorial dual-bent functions

This page was built for publication: Constructions of linear codes with two or three weights from vectorial dual-bent functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041565)