Complete transitivity of the Nordstrom-Robinson codes

In his doctorate thesis, Snover proved that any binary (m,256,d) code is equivalent to the Nordstrom-Robinson code or the punctured Nordstrom-Robinson code for (m,d)=(16,6) or (15,6) respectively. By replacing the condition that the code consists of 256 codewords with the requirement that the code is completely regular, we prove that the same result holds. Moreover, we prove that these codes are completely transitive.