On the Classification of Binary Completely Transitive Codes with Almost-Simple Top-Group

Robert F. Bailey, Daniel R. Hawtin

A code $C$ in the Hamming metric, that is, is a subset of the vertex set $V\Gamma$ of the Hamming graph $\Gamma =H(m,q)$, gives rise to a natural distance partition $\{C,C_1,\…