Error and erasure correcting algorithms for rank codes

In this paper, transmitted signals are considered as square matrices of the Maximum rank distance (MRD) (n, k, d)-codes. A new composed decoding algorithm is proposed to correct simultaneously rank errors and rank erasures. If the rank of errors and erasures is not greater than the Singleton bound, then the algorithm gives always the correct decision. If it is not a case, then the algorithm gives still the correct solution in many cases but some times the unique solution may not exist.