An Alternate Characterization of the Bentness of Binary Functions, with Uniqueness

AbstractIn a previous paper, we have obtained a characterization of the binary bent functions on (GF(2))n (n even) as linear combinations modulo $$2^{\frac{n}{2}}$$ , with integral coefficients, of characteristic functions (indicators) of $$\frac{n}{2}$$ -dimensional vector-subspaces of (GF(2))n. There is no uniqueness of the representation of a given bent function related to this characterization. We obtain now a new characterization for which there is uniqueness of the representation.

[1]  Claude Carlet,et al.  A characterization of binary bent functions , 1997, Proceedings of IEEE International Symposium on Information Theory.

[2]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[3]  J. Dillon Elementary Hadamard Difference Sets , 1974 .

[4]  David Gluck Hadamard difference sets in groups of order 64 , 1989, J. Comb. Theory, Ser. A.

[5]  Jacobus H. van Lint,et al.  Coding Theory , 1971 .

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

[7]  Claude Carlet Generalized partial spreads , 1995, IEEE Trans. Inf. Theory.