Characterization of H(n, q) by the parameters

Distance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are classified. If q ≠ 4, H(n, q) is the only such graph. If q = 4, there are precisely $\text{[}\text{n}\text{2}\text{]}$ (isomorphism classes of) such graphs other than H(n, q).