Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes

05/05/2023
by   Stanislav Kruglik, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset