On Weak and Strong -Bent Boolean Functions
Pantelimon Stănică · IEEE Transactions on Information Theory · 2016
In this paper, we introduce a sequence of discrete Fourier transforms and define new versions of bent functions, which we shall call (weak and strong) octa/hexadeca and, in general, 2k-bent functions. We investigate relationships between these classes and completely characterize the octabent and hexadecabent functions in terms of bent functions. We further find relative difference sets based upon these functions.