Identifying Codes of Degree 4 Cayley Graphs over Abelian Groups

2014/12/18 by Cristóbal Camarero, Camarero, Cristóbal, Carmen Martínez +3
Computer Science · Mathematics · #94C12 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Primary: 94B25 #Secondary: 05C69 #cs.DM #cs.IT #math.CO #math.IT #msc:05C69 #msc:94B25 #msc:94C12

paper · pdf · doi:10.48550/arxiv.1412.5830

arxiv created 2014/12/18 · arxiv updated 2014/12/22

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.

Related

• Classes of Symmetric Cayley Graphs over Finite Abelian Groups of Degrees 4 and 6
• Constructing linear codes from digraphs and groups
• Fourier analysis on distance-regular Cayley graphs over abelian groups
• Perfect codes in quintic Cayley graphs on abelian groups
• Which Haar graphs are Cayley graphs?