On the existence of generalized rank weights

We consider rank metric codes. We introduce a definition of generalized rank weights, that represents a counterpart of generalized “Hamming weights” with respect to the rank metric. We motivate our definition by the security drop behavior of rank metric wiretap network codes, by analogy to the way generalized Hamming weights characterize linear wiretap codes. We give some examples and properties to support our definition.