This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Characterization of Bent Functions in Terms of Strongly Regular Graphs
September 2001 (vol. 50 no. 9)
pp. 984-985

Abstract—In this note, we prove that bent functions can be precisely characterized in terms of a special class of strongly regular graphs, thus providing a positive answer to a question raised in the paper “Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem.”

[1] A. Bernasconi and B. Codenotti, “Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem,” IEEE Trans. Computers, vol. 48, no. 3, pp. 345-351, Mar.1999.
[2] D.M. Cvetkovic, M. Doob, and H. Sachs, Spectra of Graphs. Academic Press, 1979.

Index Terms:
Boolean functions, bent functions, strongly regular graphs.
Citation:
Anna Bernasconi, Bruno Codenotti, Jeffrey M. VanderKam, "A Characterization of Bent Functions in Terms of Strongly Regular Graphs," IEEE Transactions on Computers, vol. 50, no. 9, pp. 984-985, Sept. 2001, doi:10.1109/12.954512
Usage of this product signifies your acceptance of the Terms of Use.