2-Neighbour-Transitive Codes and Completely Transitive Codes

A code is a subset of the vertex set of a graph. Given a code, the graph metric allows one to define an associated distance partition. Imposing combinatorial regularity conditions on the distance partition of a code leads to the definitions of the classes of s-regular and completely regular codes; analogously, algebraic symmetry conditions lead to the classes of s-neighbour-transitive and completely transitive codes. I will discuss previous results and current work related to characterising and classifying subclasses of 2-neighbour-transitive and completely transitive codes in Hamming graphs. All of the results I will discuss are part of ongoing effort to provide a full classification of completely transitive codes in Hamming graphs having minimum distance at least 5.