Abstract
Minimal linear codes form a special class of linear codes that have important applications in secret sharing and secure two-party computation. These codes are characterized by the property that linearly independent codewords do not cover each other. Denoting by \(w_{\mathrm {min}}\) and \(w_{\mathrm {max}}\) the minimum and maximum weights of a binary code, respectively, such codes can be designed relatively easy when \(w_{\mathrm {min}}/w_{\mathrm {max}} > 1/2\) (the so-called Ashikhmin–Barg’s bound), whereas their construction becomes harder if \(w_{\mathrm {min}}/w_{\mathrm {max}} \le 1/2\). In this article, we extend the initiative originally taken by Ding et al. in [8] to design minimal binary linear codes that satisfy \(w_{\mathrm {min}}/w_{\mathrm {max}} \le 1/2\), which are named wide in this article. We first propose two generic methods for constructing wide minimal binary linear codes that use a class of general Maiorana-McFarland (\(\mathcal {GMM}\)) functions. The first construction is similar to the one proposed by Ding et al. and the second construction is similar to the one recently provided by Mesnager et al. [15]. Nevertheless, our constructions yield codes with better minimum distances in certain cases. The exact weight distributions of these codes are also provided. These approaches are then extended so that the dimension of the codes is increased. The dimension of the linear code \({\mathcal {C}}_f\) derived from a Boolean function f can be increased by adjoining the codewords of \({\mathcal {C}}_{D_\gamma f}\), which refers to the code associated to a (suitable) derivative of f at direction \(\gamma \). Most notably, combining the direct sum of two Boolean functions and a suitable subspace of derivatives, we obtain wide minimal codes with a substantial larger dimension. Furthermore, these wide minimal codes feature a large minimum distance when employing some special classes of permutations, such as AB (almost bent) or the inverse function.
Similar content being viewed by others
References
Ashikhmin A., Barg A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010–2017 (1998).
Bartoli D., Bonini M.: Minimal linear codes in odd characteristic. IEEE Trans. Inf. Theory 65(7), 4152–4155 (2019).
Bonini M., Borello M.: Minimal linear codes arising from blocking sets. J. Algebr. Comb. (2021). https://doi.org/10.1007/s10801-019-00930-6.
Carlet C.: Boolean models and methods in mathematics, computer science, and engineering. In: Crama Y., Hammer P. (eds.) Encyclopedia of Mathematics and its Applications, pp. 398–468. Cambridge University Press, Cambridge (2010).
Carlet C., Ding C., Yuan J.: Linear codes from highly nonlinear functions and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089–2102 (2005).
Chang S., Hyun J.: Linear codes from simplicial complexes. Des. Codes Cryptogr. 86, 2167–2181 (2018).
Ding C.: A construction of binary linear codes from Boolean functions. Discrete Math. 339(9), 2288–2303 (2016).
Ding C., Heng Z., Zhou Z.: Minimal binary linear codes. IEEE Trans. Inf. Theory 64(10), 6536–6545 (2018).
Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 64(11), 5835–5842 (2015).
Heng Z., Ding C., Zhou Z.: Minimal linear codes over finite fields. Finite Fields Appl. 54, 176–196 (2018).
Li X., Yue Q.: Four classes of minimal binary linear codes with \(w_{\text{ min }/w_{\text{ max }}} < 1/2\) derived from Boolean functions. Des. Codes Cryptogr. 88, 257–271 (2020).
MacWilliams F., Sloane N.: The Theory of Error-correcting Codes. North Holland, Amsterdam (1977).
McFarland R.: A family of difference sets in non-cyclic groups. J. Comb. Theory (series A) 15, 1–10 (1973).
Mesnager S., Özbudak F., Sınak A.: Linear codes from weakly regular plateaued functions and their secret sharing schemes. Des. Codes Crypt. 87(2–3), 463–480 (2019).
Mesnager S., Qi Y., Ru H., Tang C.: Minimal linear codes from characteristic functions. IEEE Trans. Inf. Theory 66(9), 5404–5413 (2020).
Pasalic, E., Rodríguez, R., Zhang, F., Wei, Y.: Several classes of minimal binary linear codes violating the Ashikhmin–Barg’s bound (2020). https://eprint.iacr.org/2020/1131
Rothaus O.: On bent functions. J. Comb. Theory (series A) 20, 300–305 (1976).
Sorci, J.: Minimal codes from characteristic functions not satisfying Ashikhmin–Barg’s condition (2019). arXiv:1912.12769
Tang C., Li N., Qi Y., Zhou Z., Helleseth T.: Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 62(3), 1166–1176 (2016).
Tang C., Qiu Y., Liao Q., Zhou Z.: Full characterization of minimal linear codes as cutting blocking sets. IEEE Trans. Inf. Theory (2021). https://doi.org/10.1109/TIT.2021.3070377.
Wu, X., Lu, W., Cao, X.: Minimal linear codes constructed from functions (2019). arXiv:1911.11632
Xu G., Cao X., Xu S.: Several classes of Boolean functions with few Walsh transform values. Appl. Algebra Eng. Commun. Comput. 28, 155–176 (2017).
Xu G., Qu L.: Three classes of minimal linear codes over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 65(11), 7067–7078 (2019).
Yuan J., Ding C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206–212 (2006).
Zhang, F., Pasalic, E., Rodríguez, R., Wei, Y.: A huge class of infinite sequences of minimal binary linear codes with or without crossing the Ashikhmin–Barg’s bound (2020). https://eprint.iacr.org/2020/1398
Zhang W., Yan H., Wei H.: Four families of minimal binary linear codes with \(w_{\rm min\rm /w_{\rm max}\rm \le 1/2}\). Appl. Algebra Eng. Commun. Comput. 30, 75–184 (2019).
Acknowledgements
Fengrong Zhang is supported in part by the Natural Science Foundation of China (Grant No. 61972400), and in part by the Fundamental Research Funds for the Central Universities (Grant No. 2019XKQYMS86). Enes Pasalic is partly supported by the Slovenian Research Agency (research program P1-0404 and research projects J1-9108, J1-1694). Yongzhuang Wei (corresponding author) is supported in part by the Natural Science Foundation of China (Grant No. 61872103), in part by the Guangxi Natural Science Foundation (Grant No. 2019GXNSFGA245004), and in part by the Guangxi Science and Technology Foundation (Guike AB18281019).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by T. Helleseth.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhang, F., Pasalic, E., Rodríguez, R. et al. Wide minimal binary linear codes from the general Maiorana–McFarland class. Des. Codes Cryptogr. 89, 1485–1507 (2021). https://doi.org/10.1007/s10623-021-00883-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-021-00883-7