On Weak and Strong 2k- bent Boolean Functions
Pantelimon Stănică · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · 2015
In this paper we introduce a sequence of discrete Fourier transforms and define new versions of bent functions, which we shall call (weak, strong) octa/hexa/2k-bent functions. We investigate relationships between these classes and completely characterize the octabent and hexabent functions in terms of bent functions.