Analysis of Perfect Hermitian Rank-Metric Codes and Their Covering Properties

There are no non-trivial perfect Hermitian rank-metric codes, and their covering density is bounded.