Connection of <inline-formula><tex-math id="M1">$ p $</tex-math></inline-formula>-ary <inline-formula><tex-math id="M2">$ t $</tex-math></inline-formula>-weight linear codes to Ramanujan Cayley graphs with <inline-formula><tex-math id="M3">$ t+1 $</tex-math></inline-formula> eigenvalues

Abstract

We characterize the connection between p-ary linear codes and Ramanujan Cayley graphs. We explicitly determine an equivalence between tweight linear codes over the finite field Fp and Ramanujan Cayley graphs with t + 1 eigenvalues. In particular, we get an explicit criterion on the equivalence between two-weight linear codes and Ramanujan strongly regular graphs with explicit parameters. Using this characterization, we construct several families of Ramanujan Cayley graphs with two or three eigenvalues from known linear codes with two or three weights, respectively.