On interpolation-based decoding of a class of maximum rank distance codes
Journal article, Peer reviewed
Accepted version
![Thumbnail](/bora-xmlui/bitstream/handle/11250/2986838/On_interpolation_based_decoding_of_a_class_of__MRD_codes__submitted_ISIT2021.pdf.jpg?sequence=5&isAllowed=y)
View/ Open
Date
2021Metadata
Show full item recordCollections
- Department of Informatics [928]
- Registrations from Cristin [9791]
Original version
IEEE International Symposium on Information Theory. Proceedings 10.1109/ISIT45174.2021.9517980Abstract
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.