Designs, Codes and Cryptography Прикладные компьютерные науки
Structure of Cayley codes
Аннотация
Abstract Cayley codes were introduced by Kaufman and Wigderson, as linear codes constructed from a Cayley graph and a smaller linear code. We explore general properties of the class of Cayley codes for finite groups. We give a reduction to Cayley codes for connected Cayley graphs that maintains code properties such as rate, minimum distance and symmetry. Also, we show that each Cayley code determines a family of symmetric Cayley codes, each associated with a normal edge-transitive Cayley graph, such that the given Cayley code embeds into the direct sum of these symmetric Cayley codes. We analyse several families of examples, in particular studying the behaviour of the Cayley code construction under forming direct products and Cartesian products of Cayley graphs. Finally we pose a number of open questions.