On the Bent Boolean Functions That are Symmetric
✍ Scribed by Peter Savický
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 95 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
Bent functions are the boolean functions having the maximal possible Hamming distance from the linear boolean functions. Bent functions were introduced and first studied by (\mathrm{O}). (\mathrm{S}). Rothaus in 1976 ,
We prove that there are exactly four symmetric bent functions on every even number of variables. These functions are exactly the four symmetric quadratic polynomials of the given number of variables.
📜 SIMILAR VOLUMES
A compact Hausdorff space \(T\) is constructed on which the constant functions are the only real-valued continuous ones that are locally constant on a dense subset of \(T\). ir. 1995 Academic Press. Inc
The size of ordered binary decision diagrams OBDDs strongly depends on the chosen variable ordering. It is an obvious heuristic to use symmetric variable orderings, i.e., variable orderings where symmetric variables are arranged adjacently. In order to evaluate this heuristic, methods for estimating