9 citations · 11 across the 3 of their papers we have counts for
3 papers
math.CO2014
Entry-Faithful -Neighbour Transitive Codes
Neil I. Gillespie, Michael Giudici, Daniel R. Hawtin +1
We consider a code to be a subset of the vertex set of a Hamming graph. The set of -neighbours of a code is the set of vertices, not in the code, at distance from some codew…
math.GR2014★ 2 cited
Conway groupoids and completely transitive codes
Nick Gill, Neil I. Gillespie, Jason Semeraro
To each supersimple design one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated…
math.CO2014★ 9 cited
Characterisation of a family of neighbour transitive codes
Neil I. Gillespie, Cheryl E. Praeger
We consider codes of length over an alphabet of size as subsets of the vertex set of the Hamming graph . A code for which there exists an automorphism group $X\le…