Decoding a class of maximum Hermitian rank metric codes

06/24/2021
by   Wrya K. Kadir, et al.
0

Maximum Hermitian rank metric codes were introduced by Schmidt in 2018 and in this paper we propose both interpolation-based encoding and decoding algorithms for this family of codes when the length and the minimum distance of the code are both odd.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/07/2022

Encoding and Decoding of Several Optimal Rank Metric Codes

This paper presents encoding and decoding algorithms for several familie...
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
09/05/2021

A Delicately Restricted Channel and Decoding of Maximum Rank Distance Codes

In this paper an interpolation-based decoding algorithm to decode Gabidu...
research
03/29/2023

Maximum Flag-Rank Distance Codes

In this paper we extend the study of linear spaces of upper triangular m...
research
01/06/2018

On decoding procedures of intertwining codes

One of the main weakness of the family of centralizer codes is that its ...
research
12/16/2022

Improved decoding of symmetric rank metric errors

We consider the decoding of rank metric codes assuming the error matrix ...
research
12/19/2017

A Decoding Algorithm for Rank Metric Codes

In this work we will present algorithms for decoding rank metric codes. ...

Please sign up or login with your details

Forgot password? Click here to reset