Modeling hexagonal constellations with Eisenstein-Jacobi graphs

DOI10.1134/S0032946008010018zbMath1156.05059MaRDI QIDQ950704

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

Publication date: 27 October 2008

Published in: Problems of Information Transmission (Search for Journal in Brave)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial aspects of finite geometries (05B25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)

Related Items (4)

A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Cellular automata rules solving the wireless sensor network coverage problem ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Triple loop networks with small transmission delay
• Graphs, Tessellations, and Perfect Codes on Flat Tori
• Perfect Codes for Metrics Induced by Circulant Graphs
• Codes over Gaussian integers
• Perfect Codes in the Lee Metric and the Packing of Polyominoes

This page was built for publication: Modeling hexagonal constellations with Eisenstein-Jacobi graphs