On interpolation-based decoding of a class of maximum rank distance codes
arXiv:2105.03115
Abstract
In this paper we present an interpolation-based decoding algorithm to decode a family of maximum rank distance codes proposed recently by Trombetti and Zhou. We employ the properties of the Dickson matrix associated with a linearized polynomial with a given rank and the modified Berlekamp-Massey algorithm in decoding. When the rank of the error vector attains the unique decoding radius, the problem is converted to solving a quadratic polynomial, which ensures that the proposed decoding algorithm has polynomial-time complexity.
Accepted for presentation at 2021 IEEE International Symposium on Information Theory (ISIT)