Spectral analysis of Boolean functions as a graph eigenvalue problem
Anna Bernasconi, Bruno Codenotti · IEEE Transactions on Computers · 1999
Several problems in digital logic can be conveniently approached in the spectral domain. In this paper we show that the Walsh spectrum of Boolean functions can be analyzed by looking at algebraic properties of a class of Cayley graphs associated with Boolean functions. We use this idea to investigate the Walsh spectrum of certain special functions.