Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem
IEEE Transactions on Computers
Hi-index | 14.98 |
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.驴