Log In Sign Up

Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach

by   Magali Bardet, et al.

Decoding a Reed-Solomon code can be modeled by a bilinear system which can be solved by Gröbner basis techniques. We will show that in this particular case, these techniques are much more efficient than for generic bilinear systems with the same number of unknowns and equations (where these techniques have exponential complexity). Here we show that they are able to solve the problem in polynomial time up to the Sudan radius. Moreover, beyond this radius these techniques recover automatically polynomial identities that are at the heart of improvements of the power decoding approach for reaching the Johnson decoding radius. They also allow to derive new polynomial identities that can be used to derive new algebraic decoding algorithms for Reed-Solomon codes. We provide numerical evidence that this sometimes allows to correct efficiently slightly more errors than the Johnson radius.


page 1

page 2

page 3

page 4


Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

We address the problem of decoding Gabidulin codes beyond their error-co...

Decoding supercodes of Gabidulin codes and applications to cryptanalysis

This article discusses the decoding of Gabidulin codes and shows how to ...

On the Complexity of Solving Generic Over-determined Bilinear Systems

In this paper, we study the complexity of solving generic over-determine...

On interpolation-based decoding of a class of maximum rank distance codes

In this paper we present an interpolation-based decoding algorithm to de...

Attaining Sudan's decoding radius with no genus penalty for algebraic geometry codes

In this paper we present a decoding algorithm for algebraic geometry cod...

It is undecidable whether the growth rate of a given bilinear system is 1

We show that there exists no algorithm that decides for any bilinear sys...

Improved Power Decoding of Algebraic Geometry Codes

Power decoding is a partial decoding paradigm for arbitrary algebraic ge...