|
Prikladnaya Diskretnaya Matematika, 2014, Number 3(25), Pages 28–39
(Mi pdm466)
|
|
|
|
This article is cited in 14 scientific papers (total in 14 papers)
Theoretical Foundations of Applied Discrete Mathematics
An upper bound for the number of bent functions at the distance $2^k$ from an arbitrary bent function in $2k$ variables
N. A. Kolomeec Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
Abstract:
An upper bound for the number of bent functions at the distance $2^k$ from an arbitrary bent function in $2k$ variables is obtained. The bound is reached only for quadratic bent functions. A notion of completely affine decomposable Boolean function is introduced. It is proved that only affine and quadratic Boolean functions can be completely affine decomposable.
Keywords:
Boolean functions, bent functions, quadratic bent functions.
Citation:
N. A. Kolomeec, “An upper bound for the number of bent functions at the distance $2^k$ from an arbitrary bent function in $2k$ variables”, Prikl. Diskr. Mat., 2014, no. 3(25), 28–39
Linking options:
https://www.mathnet.ru/eng/pdm466 https://www.mathnet.ru/eng/pdm/y2014/i3/p28
|
Statistics & downloads: |
Abstract page: | 356 | Full-text PDF : | 153 | References: | 78 |
|