G. Richter and S. Plass: Error and Erasure Decoding of Rank-Codes with a Modified Berlekamp-Massey Algorithm, in Proc. of ITG Conference on Source

This paper investigates error and erasure decoding methods for codes with maximum rank distance. These codes can be used for correcting column and row errors and erasures in an ( ) array. Such errors occur e.g. in magnetic tape recording or in memory chip arrays. For maximum rank distance codes (Rank-Codes), there exists a decoding algorithm similar to the Peterson-Gorenstein-Zierler technique for Reed-Solomon codes and a decoding method based on Euclid’s Division algorithm. In this paper we introduce a modified Berlekamp-Massey algorithm for the decoding of rank errors and extend it for row erasures and rank errors. Also, we investigate a decoding algorithm for both row and column erasures and rank errors.