A generalization of perfect Lee codes over Gaussian integers
2006 IEEE International Symposium on Information Theory, 2006•ieeexplore.ieee.org
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
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
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
ieeexplore.ieee.org
Showing the best result for this search. See all results