New families of completely transitive codes and distance transitive graphs
In this paper new infinite families of linear binary completely transitive codes are presented. They have covering radius $ρ= 3$ and 4, and are a half part of the binary Hamming and the binary extended Hamming code of length $n=2^m-1$ and $2^m$, respectively, where $m$ is even. From these new completely transitive codes, in the usual way, i.e., as coset graphs, new presentations of infinite families of distance transitive coset graphs of diameter three and four, respectively, are constructed.
math.CO↗