Fault tolerant algorithms via decoding: Interleaving techniques

Evaluation Interpolation algorithms are a key tool for the algebraic decoding of a large class of codes, including the famous Reed Solomon codes. Recent techniques allow the use of  this type of decoding in the more general setting of fault tolerant algorithms, where one has to interpolate erroneous data (potentially computed  by an untrusted entity).  In this talk we will present algorithms to reconstruct  a rational function (or vector) from faulty evaluations, focusing on  the number of errors and how one can handle them beyond the classical worst case unique decoding radius