Perfect Codes for Metrics Induced by Circulant Graphs
From MaRDI portal
Publication:3548883
DOI10.1109/TIT.2007.903126zbMath1325.94159OpenAlexW2130041015MaRDI QIDQ3548883
Carmen Martínez, Ernst M. Gabidulin, Ramón Beivide
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
Related Items (14)
Cyclotomic graphs and perfect codes ⋮ Dense bipartite circulants and their routing via rectangular twisted torus ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ Total perfect codes in Cayley graphs ⋮ Efficient closed domination in digraph products ⋮ Perfect Codes in Cayley Graphs ⋮ On efficiently total dominatable digraphs ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ Modeling hexagonal constellations with Eisenstein-Jacobi graphs ⋮ Perfect codes in circulant graphs ⋮ Quotients of Gaussian graphs and their application to perfect codes ⋮ Steganographic schemes from perfect codes on Cayley graphs ⋮ 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
This page was built for publication: Perfect Codes for Metrics Induced by Circulant Graphs
