Quasi-Perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension

A construction of two-quasi-perfect Lee codes is given over the space
$\mathbb Z_{p}^{n}$
for
$p$
prime,
$p\equiv \pm 5\pmod {12}$
, and
$n=2[{p}/{4}]$
. It is known that there are infinitely many such primes. Golomb and Welch conjectured that perfect codes for the Lee metric do not exist for dimension
$n\geq 3$
and radius
$r\geq 2$
. This conjecture was proved to be true for large radii as well as for low dimensions. The codes found are very close to be perfect, which exhibits the hardness of the conjecture. A series of computations show that related graphs are Ramanujan, which could provide further connections between coding and graph theories.