DeepAI
Log In Sign Up

Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric

05/20/2020
by   Hannes Bartz, et al.
0

We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the subspace metric, and linearized Reed-Solomon codes in the sum-rank metric. The speed-ups are achieved by new algorithms that reduce the cores of the underlying computational problems of the decoders to one common tool: computing left and right approximant bases of matrices over skew polynomial rings. To accomplish this, we describe a skew-analogue of the existing PM-Basis algorithm for matrices over ordinary polynomials. This captures the bulk of the work in multiplication of skew polynomials, and the complexity benefit comes from existing algorithms performing this faster than in classical quadratic complexity. The new algorithms for the various decoding-related computational problems are interesting in their own and have further applications, in particular parts of decoders of several other codes and foundational problems related to the remainder-evaluation of skew polynomials.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/19/2017

A Decoding Algorithm for Rank Metric Codes

In this work we will present algorithms for decoding rank metric codes. ...
07/04/2022

Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings and its Application in Coding Theory

Skew polynomials are a class of non-commutative polynomials that have se...
01/04/2022

Fast Decoding of Interleaved Linearized Reed-Solomon Codes and Variants

We construct s-interleaved linearized Reed-Solomon (ILRS) codes and vari...
08/22/2019

Residues of skew rational functions and linearized Goppa codes

This paper constitutes a first attempt to do analysis with skew polynomi...
02/18/2022

Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings

Skew polynomials are a class of non-commutative polynomials that have se...
11/09/2020

On the hardness of code equivalence problems in rank metric

In recent years, the notion of rank metric in the context of coding theo...
07/20/2018

Fast transforms over finite fields of characteristic two

An additive fast Fourier transform over a finite field of characteristic...