a note on the automorphism group of the hamming graph

Let m > 1 be an integer and ω be an m-set. the hamming graph h(n, m) has ω^n as its vertex-set, with two vertices are adjacent if and only if they differ in exactly one coordinate. in this paper, we provide a new proof on the automorphism group of the hamming graph h(n, m). although our result is not new (ce praeger, c schneider, permutation groups and cartesian decompositions, cambridge university press, 2018), we believe that our proof is shorter and more elementary than the known proofs for determining the automorphism group of hamming graph.