DeepAI
Log In Sign Up

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

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...
02/07/2022

Encoding and Decoding of Several Optimal Rank Metric Codes

This paper presents encoding and decoding algorithms for several familie...
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 ...
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...
11/16/2022

The Levenshtein's Sequence Reconstruction Problem and the Length of the List

In the paper, the Levenshtein's sequence reconstruction problem is consi...
06/07/2022

Neural Network Decoders for Permutation Codes Correcting Different Errors

Permutation codes were extensively studied in order to correct different...
05/17/2022

A General Framework for a Class of Quarrels: The Quarrelling Paradox Revisited

If a measure of voting power assigns greater voting power to a player be...