Modeling hexagonal constellations with Eisenstein-Jacobi graphs

DOI10.1134/S0032946008010018zbMATH Open1156.05059MaRDI QIDQ950704FDOQ950704

Authors: E. Stafford, E. M. Gabidulin, Carmen Martínez, R. Beivide 

Publication date: 27 October 2008

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

Recommendations

• Hexagonal metric for linear codes over a finite field
• Perfect Codes for Metrics Induced by Circulant Graphs
• Graphs, Tessellations, and Perfect Codes on Flat Tori
• scientific article; zbMATH DE number 691473
• Completely regular codes in the infinite hexagonal grid

Mathematics Subject Classification ID

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

Cites Work

• Perfect Codes for Metrics Induced by Circulant Graphs
• Triple loop networks with small transmission delay
• Graphs, Tessellations, and Perfect Codes on Flat Tori
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• Codes over Gaussian integers
• Title not available (Why is that?)

Cited In (7)

• Series of families of degree six circulant graphs
• Title not available (Why is that?)
• Cellular automata rules solving the wireless sensor network coverage problem
• On the broadcast independence number of circulant graphs
• A survey on undirected circulant graphs
• Graphs, Tessellations, and Perfect Codes on Flat Tori
• Perfect Codes for Metrics Induced by Circulant Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950704)