Papers
Topics
Authors
Recent
Search
2000 character limit reached

An Upper Bound on the Number of Bent Functions

Published 30 Jul 2021 in cs.IT and math.IT | (2107.14583v1)

Abstract: The number of nn-ary bent functions is less than 2<sup>3⋅2<sup>n−3(1+o(1))2<sup>{3\cdot2<sup>{n-3}(1+o(1))} as nn is even and n→∞n\rightarrow\infty. Keywords: Boolean function, bent function, upper bound

Authors (1)
Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.