Upper bounds on the numbers of binary plateaued and bent functions
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910701219479552 |
|---|---|
| author | Potapov, Vladimir N. |
| author_facet | Potapov, Vladimir N. |
| contents | The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity.
Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_16547 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Upper bounds on the numbers of binary plateaued and bent functions Potapov, Vladimir N. Information Theory Combinatorics 94D10, 94A60, 06E30 The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound |
| title | Upper bounds on the numbers of binary plateaued and bent functions |
| topic | Information Theory Combinatorics 94D10, 94A60, 06E30 |
| url | https://arxiv.org/abs/2303.16547 |