30 citations · 276 across the 127 of their papers we have counts for
150 papers
Constructing linear codes from digraphs and groups
Coen del Valle, Cheryl E. Praeger
In 2012, Kaufman and Lubotzky constructed the first family of symmetric LDPC good codes. Their construction used Cayley codes, as originally defined by Kaufman and Wigderson (2016)…
Structure of Cayley Codes
Vishnuram Arumugam, Cheryl E. Praeger, Daniel Rademacher
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…
Total closure for permutation actions of finite nonabelian simple groups
Saul D. Freedman, Michael Giudici, Cheryl Praeger
For a positive integer , a group is said to be totally -closed if for each set upon which acts faithfully, is the largest subgroup of that l…
Tournaments and Even Graphs are Equinumerous
Gordon F. Royle, Cheryl E. Praeger, S. P. Glasby +2
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the sense of an odd number of its edges, and even otherwise. Pontus von Brömssen (né…
Locally Finite Vertex-Rotary Maps and Coset Graphs with Finite Valency and Finite Edge Multiplicity
Cai Heng Li, Cheryl E. Praeger, Shu Jiao Song
It is well-known that a simple -arc-transitive graph can be represented as a coset graph for the group . This representation is extended to a construction of -arc-transiti…
Codes and Designs in Johnson Graphs From Symplectic Actions on Quadratic Forms
John Bamberg, Alice Devillers, Mark Ioppolo +1
The Johnson graph has as vertices the -subsets of , and two vertices are joined by an edge if their intersection has size . An \emph{…