**The graph of minimal distances of bent functions and its properties**

*Nikolay Kolomeec*

**Abstract: **A notion of the graph of minimal distances of bent functions is introduced. It is 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 different bent functions). The maximum degree of the graph is obtained and it is shown that all its vertices of maximum degree are quadratic. It is proven that a subgraph of the graph induced by all functions affinely equivalent to Maiorana---McFarland bent functions is connected.

**Category / Keywords: **foundations / Boolean functions, bent functions, the minimal distance, affinity

**Date: **received 15 Dec 2015

**Contact author: **nkolomeec at gmail com

**Available format(s): **PDF | BibTeX Citation

**Version: **20151218:222219 (All versions of this report)

**Short URL: **ia.cr/2015/1203

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]