Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes

07/09/2019
by   E. Guerrini, et al.
0

In this paper we present a new algorithm for Polynomial Linear System Solving (via evaluation/interpolation) with errors. In this scenario, errors can occur in the black box evaluation step. We improve the bound on the number of errors that we can correct, using techniques inspired by the decoding procedure of Interleaved Reed-Solomon Codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2021

Polynomial Linear System Solving with Random Errors: new bounds and early termination technique

This paper deals with the polynomial linear system solving with errors (...
research
05/07/2021

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

In this paper we present an interpolation-based decoding algorithm to de...
research
01/21/2020

Sparse Polynomial Interpolation Based on Diversification

We consider the problem of interpolating a sparse multivariate polynomia...
research
10/14/2020

Decoding of Interleaved Alternant Codes

Interleaved Reed-Solomon codes admit efficient decoding algorithms which...
research
05/31/2019

Collaborative Decoding of Polynomial Codes for Distributed Computation

We show that polynomial codes (and some related codes) used for distribu...
research
01/30/2019

LU factorization with errors *

We present new algorithms to detect and correct errors in the lower-uppe...
research
04/24/2018

A new class of convolutional codes and its use in the McEliece Cryptosystem

In this paper we present a new class of convolutional codes that admits ...

Please sign up or login with your details

Forgot password? Click here to reset