Perfect Codes for Metrics Induced by Circulant Graphs
From MaRDI portal
Publication:3548883
DOI10.1109/TIT.2007.903126zbMATH Open1325.94159OpenAlexW2130041015MaRDI QIDQ3548883FDOQ3548883
E. M. Gabidulin, R. Beivide, Carmen Martínez
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
Recommendations
Cited In (15)
- 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
- Perfect Codes in Cayley Graphs
- Subgroup Perfect Codes in Cayley Graphs
- Total perfect codes in Cayley graphs
- Dense bipartite circulants and their routing via rectangular twisted torus
- Perfect codes in circulant graphs
- Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
- On efficiently total dominatable digraphs
- On regular sets in Cayley graphs
- Cyclotomic graphs and perfect codes
- 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)
