Generic Decoding in the Sum-Rank Metric

01/14/2020
by   Sven Puchinger, et al.
0

We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in the Hamming and rank metric. For the same code parameters and number of errors, the new generic decoder has a larger expected complexity than the known generic decoders for the Hamming metric and smaller than the known rank-metric decoders.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/18/2019

Decoding High-Order Interleaved Rank-Metric Codes

This paper presents an algorithm for decoding homogeneous interleaved co...
08/08/2019

Hamming and simplex codes for the sum-rank metric

Sum-rank Hamming codes are introduced in this work. They are essentially...
04/26/2021

Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric

The security of code-based cryptography usually relies on the hardness o...
01/06/2022

A simple coding-decoding algorithm for the Hamming code

In this work, we present a new simple way to encode/decode messages tran...
07/28/2021

Optimal anticodes, MSRD codes, and generalized weights in the sum-rank metric

Sum-rank metric codes have recently attracted the attention of many rese...
03/31/2019

Rank Reduction in Bimatrix Games

The rank of a bimatrix game is defined as the rank of the sum of the pay...
12/19/2017

Bayesian Latent-Normal Inference for the Rank Sum Test, the Signed Rank Test, and Spearman's ρ

Bayesian inference for rank-order problems is frustrated by the absence ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.