On the Non ‐ Existence of Perfect Codes with Rank Distance
Kefei Chen · Mathematische Nachrichten · 1996
Abstract Theory of codes with rank distance was introduced in 1985, which can be applied to crisscross error correction and also used to build some cryptographical schemes. We know that the existence of perfect codes is an interesting topic in coding theory; as a new type of codes, we consider the existence of the perfect rank distance codes and prove that there are no non‐trivial perfect codes with rank metric.