𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the combinational complexity of certain symmetric Boolean functions

✍ Scribed by Larry J. Stockmeyer

Publisher
Springer
Year
1976
Tongue
English
Weight
757 KB
Volume
10
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Bent Boolean Functions That are S
On the Bent Boolean Functions That are Symmetric
✍ Peter SavickΓ½ πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 95 KB

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