Quotients of Gaussian graphs and their application to perfect codes

Citations of this article
Mendeley users who have this article in their library.


A graph-based model of perfect two-dimensional codes is presented in this work. This model facilitates the study of the metric properties of the codes. Signal spaces are modeled by means of Cayley graphs defined over the Gaussian integers and denoted as Gaussian graphs. Codewords of perfect codes will be represented by vertices of a quotient graph of the Gaussian graph in which the signal space has been defined. It will be shown that any quotient graph of a Gaussian graph is indeed a Gaussian graph. This makes it possible to apply previously known properties of Gaussian graphs to the analysis of perfect codes. To illustrate the modeling power of this graph-based tool, perfect Lee codes will be analyzed in terms of Gaussian graphs and their quotients. © 2010 Elsevier Ltd.




Martínez, C., Beivide, R., Camarero, C., Stafford, E., & Gabidulin, E. M. (2010). Quotients of Gaussian graphs and their application to perfect codes. Journal of Symbolic Computation, 45(7), 813–824. https://doi.org/10.1016/j.jsc.2010.03.013

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free