Theory of codes with rank distance was introduced in 1985, which can b
e applied to crisscross error correction and also used to build some c
ryptographical schemes. We know that the existence of perfect codes is
an interesting topic in coding theory; as a new type of codes, we con
sider the existence of the perfect rank distance codes and prove that
there are no non-trivial perfect codes with rank metric.