A new method of erasure correction by rank codes

In this paper, We introduce a notion of rank erasure and present a new algorithm of correcting rank erasures based on the matrix representation of the symmetric maximal rank distance (MRD) (N,1,N) codes. It reduces at least twice the complexity of rank erasure decoding.