76 citations · 131 across the 17 of their papers we have counts for
5 papers · 1 filter
A note on binary completely regular codes with large minimum distance
Neil I. Gillespie
We classify all binary error correcting completely regular codes of length with minimum distance .
Elusive Codes in Hamming Graphs
Daniel R. Hawtin, Neil I. Gillespie, Cheryl E. Praeger
We consider a code to be a subset of the vertex set of a Hamming graph. We examine elusive pairs, code-group pairs where the code is not determined by knowledge of its set of neigh…
Classification of a family of completely transitive codes
Neil I. Gillespie, Michael Giudici, Cheryl E. Praeger
The completely regular codes in Hamming graphs have a high degree of combinatorial symmetry and have attracted a lot of interest since their introduction in 1973 by Delsarte. This…
New characterisations of the Nordstrom-Robinson codes
Neil I. Gillespie, Cheryl E. Praeger
In his doctoral thesis, Snover proved that any binary code is equivalent to the Nordstrom-Robinson code or the punctured Nordstrom-Robinson code for or $…
Diagonally Neighbour Transitive Codes and Frequency Permutation Arrays
Neil I. Gillespie, Cheryl E. Praeger
Constant composition codes have been proposed as suitable coding schemes to solve the narrow band and impulse noise problems associated with powerline communication. In particular,…