English

Spectral properties of generalized Paley graphs and their associated irreducible cyclic codes

Combinatorics 2020-07-13 v3 Information Theory math.IT

Abstract

For q=pmq=p^m with pp prime and kq1k\mid q-1, we consider the generalized Paley graph Γ(k,q)=Cay(Fq,Rk)\Gamma(k,q) = Cay(\mathbb{F}_q, R_k), with Rk={xk:xFq}R_k=\{ x^k : x \in \mathbb{F}_q^* \}, and the irreducible pp-ary cyclic code C(k,q)={(Trq/p(γωik)i=0n1)}γFq\mathcal{C}(k,q) = \{(\textrm{Tr}_{q/p}(\gamma \omega^{ik})_{i=0}^{n-1})\}_{\gamma \in \mathbb{F}_q}, with ω\omega a primitive element of Fq\mathbb{F}_q and n=q1kn=\tfrac{q-1}{k}. We first express the spectra of Γ(k,q)\Gamma(k,q) in terms of Gaussian periods. Then, we show that the spectra of Γ(k,q)\Gamma(k,q) and C(k,q)\mathcal{C}(k,q) are mutually determined by each other if further kq1p1k\mid \tfrac{q-1}{p-1}. We give Spec(Γ(k,q))Spec(\Gamma(k,q)) explicitly for those graphs associated with irreducible 2-weight cyclic codes in the semiprimitive and exceptional cases. We also compute Spec(Γ(3,q))Spec(\Gamma(3,q)) and Spec(Γ(4,q))Spec(\Gamma(4,q)).

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

R2 v1 2026-06-23T10:53:41.278Z