DocumentCode
2944181
Title
A Generalization of Perfect Lee Codes over Gaussian Integers
Author
Martinez, Carlos ; Moreto, Miquel ; Beivide, Ramon
Author_Institution
Cantabria Univ., Santander
fYear
2006
fDate
9-14 July 2006
Firstpage
1070
Lastpage
1074
Abstract
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
Keywords
Gaussian processes; codes; graph theory; Gaussian graphs; Gaussian integers; generalized Gaussian graphs distance; perfect Lee codes; two-dimensional constellations; Error correction codes; Euclidean distance; Lattices; Physics; Signal design;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.261892
Filename
4036129
Link To Document