Perfect Codes for Metrics Induced by Circulant Graphs

An algebraic methodology for defining new metrics over two-dimensional signal spaces is presented in this work. We have mainly considered quadrature amplitude modulation (QAM) constellations which have previously been modeled by quotient rings of Gaussian integers. The metric over these constellations, based on the distance concept in circulant graphs, is one of the main contributions of this work. A detailed analysis of some degree-four circulant graphs has allowed us to detail the weight distribution for these signal spaces. A new family of perfect codes over Gaussian integers will be defined and characterized by providing a solution to the perfect t-dominating set problem over the circulant graphs presented. Finally, we will show how this new metric can be extended to other signal sets by considering hexagonal constellations and circulant graphs of degree six.

[1]  Mateo Valero,et al.  Discrete Optimization Problem in Local Networks and Data Alignment , 1987, IEEE Transactions on Computers.

[2]  Agustin Arruabarrena,et al.  Optimal Distance Networks of Low Degree for Parallel Computers , 1991, IEEE Trans. Computers.

[3]  K. Huber,et al.  Codes over Eisenstein-Jacobi integers , 1994 .

[4]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

[5]  Klaus Huber.  Codes over Gaussian integers , 1994, IEEE Trans. Inf. Theory.

[6]  José L. Balcázar,et al.  Optimized mesh-connected networks for SIMD and MIMD architectures , 1987, ISCA '87.

[7]  M. Sami Fadali,et al.  What Designers of Bus and Network Architectures Should Know about Hypercubes , 2003, IEEE Trans. Computers.

[8]  Jhing-Fa Wang,et al.  Reliable circulant networks with minimum transmission delay , 1985 .

[9]  Ramón Beivide,et al.  On the perfect t-dominating set problem in circulant graphs and codes over gaussian integers , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[10]  Pranava K. Jha.  Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh , 2003, Inf. Process. Lett..

[11]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[12]  J.-C. Bermond,et al.  An Optimization Problem in Distributed Loop Computer Networks , 1989 .

[13]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

[14]  S. Golomb,et al.  Perfect Codes in the Lee Metric and the Packing of Polyominoes , 1970 .

[15]  Sueli I. Rodrigues Costa,et al.  Graphs, tessellations, and perfect codes on flat tori , 2004, IEEE Transactions on Information Theory.

[16]  Chak-Kuen Wong,et al.  A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.

[17]  Reginaldo Palazzo Júnior,et al.  Lattice constellations and codes from quadratic number fields , 2001, IEEE Transactions on Information Theory.