Perfect Codes for Metrics Induced by Circulant Graphs

DOI10.1109/TIT.2007.903126MaRDI QIDQ3548883zbMATH OpenOpenAlexFDO

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

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.903126

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial codes (94B25)

Recommendations

• Perfect codes in circulant graphs
• Quotients of Gaussian graphs and their application to perfect codes
• Graphs, Tessellations, and Perfect Codes on Flat Tori
• Modeling hexagonal constellations with Eisenstein-Jacobi graphs
• Cyclotomic graphs and perfect codes

Cited in

(16)

• Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers
• A family of efficient six-regular circulants representable as a Kronecker product
• Steganographic schemes from perfect codes on Cayley graphs
• Quotients of Gaussian graphs and their application to perfect codes
• Subgroup Perfect Codes in Cayley Graphs
• Total perfect codes in Cayley graphs
• Perfect codes in circulant graphs
• Dense bipartite circulants and their routing via rectangular twisted torus
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
• On efficiently total dominatable digraphs
• Graphs, Tessellations, and Perfect Codes on Flat Tori
• On regular sets in Cayley graphs
• Cyclotomic graphs and perfect codes
• Perfect codes in Cayley graphs
• Modeling hexagonal constellations with Eisenstein-Jacobi graphs
• Efficient closed domination in digraph products

This page was built for publication: Perfect Codes for Metrics Induced by Circulant Graphs

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