Quasi-perfect geometrically uniform codes derived from graphs over Gaussian integer rings

In this paper we present a generalization of the perfect codes derived from the quotient rings of Gaussian integers. We call this class of codes quasi-perfect, which in addition to preserving the property of being geometrically uniform codes they are able to correct more error patterns than the perfect codes.