New Rank Codes with Efficient Decoding
E.M. Gabidulin · 2017
Linear maximum rank distance (MRD) codes in vector representation for all parameters are known for many years [3], [4]. There exist fast decoding algorithms to correct rank errors and rank erasures for these codes [3], [5], [6], [7]. Recently, Sheekey [8] and other researches [9], [10], [11], [12] proposed new families of the vector MRD codes. No decoding algorithms were still described. In this paper, generator and parity-check matrices are constructed for a few new codes. Our contribution is a new construction of the vector MRD codes based on modification of codes from [3]. Efficient decoding algorithms are described.