Quotients of Gaussian graphs and their application to perfect codes

DOI10.1016/J.JSC.2010.03.013zbMath1203.94136OpenAlexW2078599769MaRDI QIDQ975827

Ernst M. Gabidulin, E. Stafford, Ramón Beivide, Cristóbal Camarero, Carmen Martínez

Publication date: 11 June 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.03.013

zbMATH Keywords

perfect codesGaussian integersLee metriccodes on graphsGaussian graphmetric properties on codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (2)

Cyclotomic graphs and perfect codes ⋮ Perfect Codes in Cayley Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• Perfect codes in graphs
• Perfect Codes for Metrics Induced by Circulant Graphs
• A recursive approach to low complexity codes
• Codes over Gaussian integers
• Lee distance and topological properties of k-ary n-cubes
• Modeling Toroidal Networks with the Gaussian Integers
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• Complete Residue Systems in the Gaussian Integers

This page was built for publication: Quotients of Gaussian graphs and their application to perfect codes