Decoding of Space-Symmetric Rank Errors

02/04/2021
by   Thomas Jerkovits, et al.
0

This paper investigates the decoding of certain Gabidulin codes that were transmitted over a channel with space-symmetric errors. Space-symmetric errors are additive error matrices that have the property that their column and row spaces are equal. We show that for channels restricted to space-symmetric errors, with high probability errors of rank up to 2(n-k)/3 can be decoded with a Gabidulin code of length n and dimension k, using a weak-self orthogonal basis as code locators.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
12/16/2022

Improved decoding of symmetric rank metric errors

We consider the decoding of rank metric codes assuming the error matrix ...
research
11/13/2020

On symmetric and Hermitian rank distance codes

Let M denote the set S_n, q of n × n symmetric matrices with entries in ...
research
01/22/2018

On the List Decodability of Self-orthogonal Rank Metric Codes

V. Guruswami and N. Resch prove that the list decodability of F_q-linear...
research
04/18/2019

Decoding High-Order Interleaved Rank-Metric Codes

This paper presents an algorithm for decoding homogeneous interleaved co...
research
04/15/2023

Random ε-Cover on Compact Symmetric Space

A randomized scheme that succeeds with probability 1-δ (for any δ>0) has...
research
06/07/2022

Neural Network Decoders for Permutation Codes Correcting Different Errors

Permutation codes were extensively studied in order to correct different...

Please sign up or login with your details

Forgot password? Click here to reset