Issue No. 09 - September (2001 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.954512
<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>
Boolean functions, bent functions, strongly regular graphs.
B. Codenotti, J. M. VanderKam and A. Bernasconi, "A Characterization of Bent Functions in Terms of Strongly Regular Graphs," in IEEE Transactions on Computers, vol. 50, no. , pp. 984-985, 2001.