Yaqian Zhang, Shanghai Jiao Tong University

In distributed storage systems, erasure codes are deployed to ensure system reliability with low storage overhead. Minimum storage cooperative regenerating codes are a class of erasure codes that provides the optimal-bandwidth repair for multiple node failures, while retaining the minimum storage overhead. In this talk, I will introduce the background of coding problem for distributed storage, the cooperative repair model, and some constructions of minimum storage cooperative regenerating codes.