Identifying codes of degree 4 Cayley graphs over abelian groups
From MaRDI portal
Abstract: In this paper a wide family of identifying codes over regular Cayley graphs of degree four which are built over finite Abelian groups is presented. Some of the codes in this construction are also perfect. The graphs considered include some well-known graphs such as tori, twisted tori and Kronecker products of two cycles. Therefore, the codes can be used for identification in these graphs. Finally, an example of how these codes can be applied for adaptive identification over these graphs is presented.
Recommendations
Cites work
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Adaptive identification in Torii in the King lattice
- Adaptive identification in graphs
- Complete Residue Systems in the Gaussian Integers
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- General bounds for identifying codes in some infinite regular graphs
- Hamiltonian decomposition of Cayley graphs of degree 4
- Identifying codes with small radius in some infinite regular graphs
- Modeling Toroidal Networks with the Gaussian Integers
- On a new class of codes for identifying vertices in graphs
- On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
- On the density of identifying codes in the square lattice
- Optimal distance networks of low degree for parallel computers
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Perfect codes in direct products of cycles-a complete characterization
Cited in
(3)
This page was built for publication: Identifying codes of degree 4 Cayley graphs over abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346707)
