Abstract
In 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Carlet, Generalized Partial Spreads, IEEE Transactions on Information Theory, Vol. 41 (1995) pp. 1482–1487.
C. Carlet and P. Guillot, A characterization of binary bent functions, Journal of Combinatorial Theory, Series A, Vol. 76, No.2 (1996) pp. 328–335.
J. F. Dillon, Elementary Hadamard Difference sets, Ph. D. Thesis, Univ. of Maryland (1974).
JPS. Kung; Source Book in Matroïd Theory; Birkhäuser (1986).
F. J. Mac Williams and N. J. Sloane, The theory of error-correcting codes, Amsterdam, North Holland (1977).
Gian-Carlo Rota; On the foundations of Combinatorial Theory; Springer Verlag (1964); reprint in [4].
O. S. Rothaus, On bent functions, J. Comb. Theory, 20A (1976) pp. 300–305.
J. H. van Lint, Coding Theory, Springer Verlag 201 (1970).
Rights and permissions
About this article
Cite this article
Carlet, C., Guillot, P. An Alternate Characterization of the Bentness of Binary Functions, with Uniqueness. Designs, Codes and Cryptography 14, 133–140 (1998). https://doi.org/10.1023/A:1008283912025
Issue Date:
DOI: https://doi.org/10.1023/A:1008283912025