Uniqueness of certain completely regular Hadamard codes

We classify binary completely regular codes of length m with minimum distance δ for (m,δ)=(12,6) and (11,5). We prove that such codes are unique up to equivalence, and in particular, are equivalent to certain Hadamard codes. Moreover, we prove that these codes are completely transitive.