A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme (Q2309688)

Let \(\mathcal{C}\) be a linear code, a codeword \(c\in \mathcal{C}\) is said to be a minimal codeword if its support (i.e. the set of non-zero coordinates) determines \(c\) up to a scalar factor. Minimal codewords can be used in linear codes-based access structures in secret sharing schemes (SSS), using a construction proposed by Massey. However, it is a hard task to determine the set of the minimal codewords of a given code, even in the binary case and if pre-processing is allowed. Due to these problems, minimal linear codes, i.e. linear codes such that all their nonzero codewords are minimal, have been introduced and intensively investigated in the literature. In [IEEE Trans. Inf. Theory 44, No. 5, 2010--2017 (1998; Zbl 0932.94032)] \textit{A. Ashikhmin} and \textit{A. Barg} gave a useful criterion for a linear code to be minimal, i.e. A linear code \(\mathcal{C}\) over \(\mathbb{F}_q\) is minimal if \(\frac{w_{min}}{w_{max}} > \frac{q-1}{q},\) where \(w_{min}\) and \(w_{max}\) respectively denote the minimum and maximum nonzero Hamming weights in \(\mathcal{C}\). In this paper, the authors construct a linear code from resilient maps on vector spaces over fields and use the Ashikhmin-Barg condition to show such code to be minimal. The dual-code of this code is used to construct a vector space secret sharing scheme (VSSS), according to the construction done in [\textit{C. Padró} et al., Des. Codes Cryptography 16, No. 1, 75--85 (1999; Zbl 0974.94006)], which guarantees improved security against cheaters.