A Decoding Algorithm for Rank Metric Codes

In this work we will present algorithms for decoding rank metric codes. First we will look at a new decoding algorithm for Gabidulin codes using the property of Dickson matrices corresponding to linearized polynomials. We will be using a Berlekamp-Massey-like algorithm in the process. We will show the difference between our and existing algorithms. Apart from being a new algorithm, it is also interesting that it can be modified to get a decoding algorithm for general twisted Gabidulin codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2020

Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric

We speed up existing decoding algorithms for three code classes in diffe...
research
06/24/2021

Decoding a class of maximum Hermitian rank metric codes

Maximum Hermitian rank metric codes were introduced by Schmidt in 2018 a...
research
08/20/2019

Decoding Downset codes over a finite grid

In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a d...
research
02/27/2020

NP-Complete Problems for Lee Metric Codes

We consider codes over finite rings endowed with the Lee metric and prov...
research
07/17/2020

Decoding up to 4 errors in Hyperbolic-like Abelian Codes by the Sakata Algorithm

We deal with two problems related with the use of the Sakata's algorithm...
research
08/20/2020

Erasure decoding of convolutional codes using first order representations

In this paper, we employ the linear systems representation of a convolut...
research
03/23/2022

Rank-Metric Codes and Their Applications

The rank metric measures the distance between two matrices by the rank o...

Please sign up or login with your details

Forgot password? Click here to reset