  We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code
and ask: can we correctly repair a failed node in the presence of erroneous
nodes? Equivalently, we consider the collection of downloaded traces as a code
and investigate its code-distance properties. We propose three lower bounds on
its minimum distance and study methods to efficiently correct errors close to
these bounds.
