Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.28611

Structure of Cayley Codes

Vishnuram Arumugam·Cheryl E. Praeger·Daniel Rademacher
View original source ↗Read source document ↗Export metadata ↓

Abstract

Cayley codes, introduced by Kaufman and Wigderson, are 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. In particular we give a reduction to Cayley codes for connected Cayley graphs that maintains code properties such as rate, minimum distance and symmetry. Also, for a given Cayley code, we identify 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 the 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, and we pose a number of open questions.

Explore related subjects

math.COmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vishnuram Arumugam, Cheryl E. Praeger, Daniel Rademacher. 2026-06-26. Structure of Cayley Codes. https://arxiv.org/abs/2606.28611

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗