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

Designs, Codes, and Cryptography

Volumn 14, Issue 2, 1998, Pages 133-140

  Carlet, Claude ^a,b   Guillot, Philippe ^c  

^a INRIA   (France)

^b UNIVERSITÉ DE CAEN   (France)

^c THALES   (France)

Author keywords

Bent functions; M bius function

Indexed keywords

EID: 0007109121     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008283912025     Document Type: Article

References (8)

1. C. Carlet, Generalized Partial Spreads, IEEE Transactions on Information Theory, Vol. 41 (1995) pp. 1482-1487.
2. 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.
3. J. F. Dillon, Elementary Hadamard Difference sets, Ph. D. Thesis, Univ. of Maryland (1974).
4. JPS. Kung; Source Book in Matroïd Theory; Birkhäuser (1986).
5. F. J. Mac Williams and N. J. Sloane, The theory of error-correcting codes, Amsterdam, North Holland (1977).
6. Gian-Carlo Rota; On the foundations of Combinatorial Theory; Springer Verlag (1964); reprint in [4].
7. O. S. Rothaus, On bent functions, J. Comb. Theory, 20A (1976) pp. 300-305.
8. J. H. van Lint, Coding Theory, Springer Verlag 201 (1970).