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 neighbours. We construct a new infinite family of elusive pairs, where the group in question acts transitively on the set of neighbours of the code. In these examples, the alphabet size always divides the length of the code. We show that there is no elusive pair for the smallest set of parameters that does not satisfy this condition. We also pose several questions regarding elusive pairs. © 2013 Australian Mathematical Publishing Association Inc.