Chrestenson Spectrum Computation Using Cayley Color Graphs

A method based on eigenvalue computations is formulated for computing the Chrestenson spectrum of a discrete p-valued function. This technique is developed by considering an extension to the same approach of computation of the Walsh spectrum for a twovalued function and is then generalized to the p-valued case. Algebraic groups are formulated that correspond to Cayley color graphs based on the function of interest whose adjacency matrices have spectra equivalent to the Walsh or Chrestenson spectrum of the function under consideration. Because the transformation matrix is not used in any of these computations, the method provides an alternative approach for spectral computations.