A Generalization of Perfect Lee Codes over Gaussian Integers
Carmen Martínez, Miquel Moretó, Ramón Beivide, E.M. Gabidulin · 2006
In this paper we present perfect codes for two-dimensional constellations derived from generalized Gaussian graphs, a family of graphs built over quotient rings of Gaussian integers. Using the generalized Gaussian graphs distance, we solve the problem of finding t-dominating sets and, then, we build new perfect codes over these graphs. The well-known perfect Lee codes can be viewed as a particular subcase of the perfect Gaussian codes introduced in this work