The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2001 vol.50)
pp: 984-985
ABSTRACT
<p><b>Abstract</b>—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.”</p>
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, September 2001, doi:10.1109/12.954512
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool