On the classification of binary completely transitive codes with almost-simple top-group (Q2080231): Difference between revisions

In this paper, the authors were interested in the classification of binary completely transitive codes with almost-simple top-group. A code in this paper is a subset of the vertex set of the Hamming graph. The authors are interested in a particular classes of these codes i.e. completely transitive codes i.e. subfamily of completely regular codes. Characterisation of certain families of neighbour-transitive codes in Hamming graphs have been known before as well as some classification results of subfamilies of neighbour-transitive codes in Johnson graphs. The main result provide the classification of binary completely transitive codes having minimum distance at least 5 and particular automorphism group, described in the paper. Further, the authors were interested in distance-regular graphs related to these codes.