Let be a perfect 1-error-correcting code of length . We show that a quotient of the minimum distance graph of constitutes an invariant for more sensible than those studied up to the present, namely the kernel dimension and the rank. As a by-product, we get a nonlinear Vasil’ev code all of whose associated Steiner triple systems are linear. Finally, the determination of for known families of ’s is presented.
