Bent functions embedded into the recursive framework of Z-bent functions
Suppose that n is even. Let F(2) denote the two-element field and Z the set of integers. Bent functions can be defined as +/- 1-valued functions on F(2)(n) with +/- 1-valued Fourier transform. More generally we call a mapping f on F(2)(n) a Z-bent function if both f and its Fourier transform (f) over cap are integer-valued. Z-bent functions f are separated into different levels, depending on the size of the maximal absolute value attained by f and (f) over cap. It is shown how Z-bent functions of lower level can be built up recursively by gluing together Z-bent functions of higher level. This recursion comes down at level zero, containing the usual bent functions. In the present paper we start to study bent functions in the framework of Z-bent functions and give some guidelines for further research.
bent function recursive boolean function construction