|
Problemy Peredachi Informatsii, 1997, Volume 33, Issue 1, Pages 75–86
(Mi ppi361)
|
|
|
|
This article is cited in 15 scientific papers (total in 15 papers)
Coding Theory
On the Propagation Criterion for Boolean Functions and on Bent Functions
V. V. Yashchenko
Abstract:
We consider the parameters of a Boolean function that characterize its position relative to the first-order Reed-Muller code $R(1,n)$. We establish simple criteria of a given vector being, for a given Boolean function, unessential, a linear structure, or belonging to $P\mathbb C(f)$. We find conditions under which the set $P\mathbb C(f)$ contains some linear subspace (without zero). We show that the greater the dimension of the subspace, the more distant such functions are from $R(1,n)$. We obtain a new description of the class of bent functions most remote from $R(1,n)$.
Received: 31.10.1995 Revised: 28.06.1996
Citation:
V. V. Yashchenko, “On the Propagation Criterion for Boolean Functions and on Bent Functions”, Probl. Peredachi Inf., 33:1 (1997), 75–86; Problems Inform. Transmission, 33:1 (1997), 62–71
Linking options:
https://www.mathnet.ru/eng/ppi361 https://www.mathnet.ru/eng/ppi/v33/i1/p75
|
Statistics & downloads: |
Abstract page: | 532 | Full-text PDF : | 330 |
|