Spectral properties of generalized Paley graphs and their associated irreducible cyclic codes
Combinatorics
2020-07-13 v3 Information Theory
math.IT
Abstract
For with prime and , we consider the generalized Paley graph , with , and the irreducible -ary cyclic code , with a primitive element of and . We first express the spectra of in terms of Gaussian periods. Then, we show that the spectra of and are mutually determined by each other if further . We give explicitly for those graphs associated with irreducible 2-weight cyclic codes in the semiprimitive and exceptional cases. We also compute and .
Cite
@article{arxiv.1908.08097,
title = {Spectral properties of generalized Paley graphs and their associated irreducible cyclic codes},
author = {Ricardo A. Podestá and Denis E. Videla},
journal= {arXiv preprint arXiv:1908.08097},
year = {2020}
}
Comments
We have improved Definition 3.1 and the comments before it. We have improved Theorem 4.1 (now a complete characterization of Ramanujan graphs) and give a complete proof. 22 pages, 6 tables