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

## TL;DR

This paper introduces a novel algorithm for solving polynomial linear systems with errors during evaluation, enhancing error correction bounds by leveraging decoding techniques from Interleaved Reed-Solomon Codes.

## Contribution

The paper presents a new algorithm that improves error correction bounds in polynomial linear system solving by applying decoding methods from interleaved Reed-Solomon codes.

## Key findings

- Enhanced error correction bounds achieved
- Algorithm effectively handles errors in evaluation step
- Inspired by Reed-Solomon decoding techniques

## Abstract

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.