Minimal Binary Linear Codes From Vectorial Boolean Functions
From MaRDI portal
Abstract: Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a new method to construct minimal linear codes by using vectorial Boolean functions. Firstly, we give a necessary and sufficient condition for a generic class of linear codes from vectorial Boolean functions to be minimal. Based on that, we derive some new three-weight minimal linear codes and determine their weight distributions. Secondly, we obtain a necessary and sufficient condition for another generic class of linear codes from vectorial Boolean functions to be minimal and to be violated the AB condition. As a result, we get three infinite families of minimal linear codes violating the AB condition. To the best of our knowledge, this is the first time that minimal liner codes are constructed from vectorial Boolean functions. Compared with other known ones, in general the minimal liner codes obtained in this paper have higher dimensions.
Cited in
(5)- Four classes of wide minimal q-ary linear codes from a general method
- Minimal linear codes from vectorial functions
- Several classes of wide minimal binary linear codes based on general Maiorana-McFarland class
- Several classes of minimal linear codes from vectorial Boolean functions and p-ary functions
- Constructions of binary self-orthogonal singly-even wide minimal linear codes with few weights
This page was built for publication: Minimal Binary Linear Codes From Vectorial Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197477)
