|
A graph of minimal distances between bent functions
N. A. Kolomeec Sobolev Institute of Mathematics SB RAS, Novosibirsk
Abstract:
A graph of minimal distances between bent functions is introduced as an undirected graph $(V, E)$, where $V$ is the set of all bent functions in $2k$ variables and $(f, g) \in E$ if the Hamming distance between $f$ and $g$ is equal to $2^k$ (it is the minimal possible distance between two bent functions). It is shown that its subgraph induced by all functions affine equivalent to the Maiorana—McFarland bent functions is connected.
Key words:
Boolean functions, bent functions, the minimal distance.
Received 02.III.2015
Citation:
N. A. Kolomeec, “A graph of minimal distances between bent functions”, Mat. Vopr. Kriptogr., 7:2 (2016), 103–110
Linking options:
https://www.mathnet.ru/eng/mvk187https://doi.org/10.4213/mvk187 https://www.mathnet.ru/eng/mvk/v7/i2/p103
|
Statistics & downloads: |
Abstract page: | 319 | Full-text PDF : | 178 | References: | 45 | First page: | 4 |
|