Log In Sign Up

On interpolation-based decoding of a class of maximum rank distance codes

by   Wrya K. Kadir, et al.

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.


page 1

page 2

page 3

page 4


Decoding a class of maximum Hermitian rank metric codes

Maximum Hermitian rank metric codes were introduced by Schmidt in 2018 a...

A Delicately Restricted Channel and Decoding of Maximum Rank Distance Codes

In this paper an interpolation-based decoding algorithm to decode Gabidu...

On Decoding Fountain Codes with Erroneous Received Symbols

Motivated by the application of fountain codes in the DNA-based data sto...

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

We address the problem of decoding Gabidulin codes beyond their error-co...

Efficient Decoding of Gabidulin Codes over Galois Rings

This paper presents the first decoding algorithm for Gabidulin codes ove...

Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach

Decoding a Reed-Solomon code can be modeled by a bilinear system which c...