A new general construction for generalized bent functions

A simple, yet general method of constructing bent functions is presented. For certain applications it is of interest to minimize the size of the image of a bent function. In this study a tight lower bound on the number of elements in the image is established under certain conditions. >

[1]  Abraham Lempel,et al.  Maximal families of bent sequences , 1982, IEEE Trans. Inf. Theory.

[2]  A. T. Butson,et al.  Relative difference sets , 1966 .

[3]  P. Vijay Kumar,et al.  Generalized Bent Functions and Their Properties , 1985, J. Comb. Theory, Ser. A.

[4]  P. Vijay Kumar,et al.  On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function , 1988, IEEE Transactions on Information Theory.

[5]  P. Vijay Kumar,et al.  Frequency-hopping code sequence designs having large linear span , 1988, IEEE Trans. Inf. Theory.

[6]  Robert A. Scholtz,et al.  Bent-function sequences , 1982, IEEE Trans. Inf. Theory.

[7]  O. S. Rothaus,et al.  On "Bent" Functions , 1976, J. Comb. Theory, Ser. A.