Correcting generalized matrix erasures with applications to random network coding

Rank-metric codes are widely used in communications and recently in random network coding. In this paper generalized matrix erasures are defined and an algorithm to correct them is described. However, the main result is that we show that for the common channel model in random network coding only erasures, and no random errors have to be corrected.