A Delicately Restricted Channel and Decoding of Maximum Rank Distance Codes

09/05/2021
by   Wrya K. Kadir, et al.
0

In this paper an interpolation-based decoding algorithm to decode Gabidulin codes, transmitted through a finely restricted channel, is proposed. The algorithm is able to decode rank errors beyond half the minimum distance by one unit. Also the existing decoding algorithms for generalized twisted Gabidulin codes and additive generalized twisted Gabidulin codes are improved.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
02/04/2021

Decoding of (Interleaved) Generalized Goppa Codes

Generalized Goppa codes are defined by a code locator set ℒ of polynomia...
research
02/04/2021

Decoding of Space-Symmetric Rank Errors

This paper investigates the decoding of certain Gabidulin codes that wer...
research
05/07/2021

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

In this paper we present an interpolation-based decoding algorithm to de...
research
10/14/2020

Decoding of Interleaved Alternant Codes

Interleaved Reed-Solomon codes admit efficient decoding algorithms which...
research
04/05/2019

F_q^n-linear rank distance codes and their distinguishers

For any admissible value of the parameters there exist Maximum Rank dist...
research
12/29/2018

The Crossover-Distance for ISI-Correcting Decoding of Convolutional Codes in Diffusion-Based Molecular Communications

In diffusion based molecular communication, the intersymbol interference...

Please sign up or login with your details

Forgot password? Click here to reset