
arXiv: 2212.11325
The family of bent functions is a known class of Boolean functions, which have a great importance in cryptography. The Cayley graph defined on \(\mathbb{Z}_{2}^{n}\) by the support of a bent function is a strongly regular graph \(srg(v,k,\lambda,\mu)\), with \(\lambda=\mu\). In this note we list the parameters of such Cayley graphs. Moreover, it is given a condition on \((n,m)\)-bent functions \(F=(f_1,\ldots,f_m)\), involving the support of their components \(f_i\), and their \(n\)-ary symmetric differences.
FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT), FOS: Mathematics, Mathematics - Combinatorics, 94D10, 05E30, Combinatorics (math.CO)
FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT), FOS: Mathematics, Mathematics - Combinatorics, 94D10, 05E30, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
