Quotients of Gaussian graphs and their application to perfect codes
type: Item
instance of: scholarly article
title: Quotients of Gaussian graphs and their application to perfect codes
zbMATH Open document ID: 1203.94136
author: E. Stafford
author: E. M. Gabidulin
author: Carmen Martínez
author: R. Beivide
author: Cristóbal Camarero
published in: Journal of Symbolic Computation
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 5720160
zbMATH Keywords: Gaussian integers
zbMATH Keywords: metric properties on codes
zbMATH Keywords: perfect codes
zbMATH Keywords: Lee metric
zbMATH Keywords: codes on graphs
zbMATH Keywords: Gaussian graph
MaRDI profile type: Publication
full work available at URL: j.jsc.2010.03.013
OpenAlex ID: W2078599769
cites work: Q5598073
cites work: Perfect codes in graphs
cites work: Lee distance and topological properties of k-ary n-cubes
cites work: Q4342497
cites work: Perfect Codes in the Lee Metric and the Packing of Polyominoes
cites work: Q5772619
cites work: Codes over Gaussian integers
cites work: Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
cites work: Complete Residue Systems in the Gaussian Integers
cites work: Q5284096
cites work: Perfect Codes for Metrics Induced by Circulant Graphs
cites work: Modeling Toroidal Networks with the Gaussian Integers
cites work: Entropy waves, the zig-zag graph product, and new constant-degree expanders
cites work: A recursive approach to low complexity codes
DOI: 10.1016/J.JSC.2010.03.013
description: scientific article; zbMATH DE number 5720160