The application of Reed-Solomon (RS) codes in distributed storage
systems is widespread. A lot of literature have proposed repair schemes
for RS codes with one or multiple failed symbols, which can reduce
communication cost during repair (i.e. repair bandwidth).
Â However, for repair schemes of RS codes with multiple failed symbols,
Â the existing distributed repair schemes can only repair $e=2,3$
erasures. In this paper, by intelligently dividing the set of evaluation
points corresponding to failed symbols, a distributed repair scheme for
RS codes with $e\geq 4$ erasures are proposed.