Fast decoding of rank-codes with rank errors and column erasures
Gerd Richter, Simon Plass · 2004
This paper describes the decoding of Rank-Codes with different decoding algorithms. A new modified Berlekamp-Massey algorithm for correcting rank errors and column erasures is described. These algorithms consist of two decoding steps. The first step is the puncturing of the code and the decoding in the punctured code. The second step is the column erasure decoding in the original code. Thus decoding step is about half as complex as the known algorithms