  This paper presents new lower bounds for the lattice covering densities of
simplices by studying the Degree-Diameter Problem for abelian Cayley digraphs.
In particular, it proves that the density of any lattice covering of a
tetrahedron is at least $25/18$ and the density of any lattice covering of a
four-dimensional simplex is at least $343/264$.
