  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.
