Skip to main content
Article thumbnail
Location of Repository

On weak and strong 2k-bent Boolean functions

By Pantelimon Stănică


In this paper we introduce a sequence of discrete Fourier trans- forms and de ne new versions of bent functions, which we shall call (weak, strong) octa/hexa/2k-bent functions. We investigate relation- ships between these classes and completely characterize the octabent and hexabent functions in terms of bent functions

Topics: Boolean functions, Walsh-Hadamard transforms, bent, negabent, octabent, hexabent functions
Year: 2015
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.