The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs

by   Khodakhast Bibak, et al.

Let _n[i] be the ring of Gaussian integers modulo a positive integer n. Very recently, Camarero and Martínez [IEEE Trans. Inform. Theory, 62 (2016), 1183–1192], showed that for every prime number p>5 such that p≡± 5 12, the Cayley graph 𝒢_p=Cay(_p[i], S_2), where S_2 is the set of units of _p[i], induces a 2-quasi-perfect Lee code over _p^m, where m=2⌊p/4⌋. They also conjectured that 𝒢_p is a Ramanujan graph for every prime p such that p≡ 3 4. In this paper, we solve this conjecture. Our main tools are Deligne's bound from 1977 for estimating a particular kind of trigonometric sum and a result of Lovász from 1975 (or of Babai from 1979) which gives the eigenvalues of Cayley graphs of finite Abelian groups. Our proof techniques may motivate more work in the interactions between spectral graph theory, character theory, and coding theory, and may provide new ideas towards the famous Golomb–Welch conjecture on the existence of perfect Lee codes.



There are no comments yet.


page 1

page 2

page 3

page 4


The existence of perfect codes in Doob graphs

We solve the problem of existence of perfect codes in the Doob graph. It...

On the number of q-ary quasi-perfect codes with covering radius 2

In this paper we present a family of q-ary nonlinear quasi-perfect codes...

Additive perfect codes in Doob graphs

The Doob graph D(m,n) is the Cartesian product of m>0 copies of the Shri...

On the nonexistence of linear perfect Lee codes

In 1968, Golomb and Welch conjectured that there does not exist perfect ...

On the non-existence of linear perfect Lee codes: The Zhang-Ge condition and a new polynomial criterion

The Golomb-Welch conjecture (1968) states that there are no e-perfect Le...

Spectral and Combinatorial Properties of Some Algebraically Defined Graphs

Let k> 3 be an integer, q be a prime power, and F_q denote the field of ...

PHOEG Helps Obtaining Extremal Graphs

Extremal Graph Theory aims to determine bounds for graph invariants as w...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.