activity
20112026
most citedExact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems

12 citations · 44 across the 10 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2018★ 1 cited

A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair

Hanxu Hou, Yunghsiang Han, Patrick P. C. Lee +2

Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundan…

cs.IT2018★ 4 cited

Rack-Aware Regenerating Codes for Data Centers

Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum +1

Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy. Since the cross-rack communication cost is often high,…

cs.IT2012★ 5 cited

Analysis and Construction of Functional Regenerating Codes with Uncoded Repair for Distributed Storage Systems

Yuchong Hu, Patrick P. C. Lee, Kenneth W. Shum

Modern distributed storage systems apply redundancy coding techniques to stored data. One form of redundancy is based on regenerating codes, which can minimize the repair bandwidth…

cs.IT2012★ 8 cited

Cooperative Regenerating Codes

Kenneth W. Shum, Yuchong Hu

One of the design objectives in distributed storage system is the minimization of the data traffic during the repair of failed storage nodes. By repairing multiple failures simulta…

cs.IT2011★ 12 cited

Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems

Kenneth W. Shum, Yuchong Hu

In order to provide high data reliability, distributed storage systems disperse data with redundancy to multiple storage nodes. Regenerating codes is a new class of erasure codes t…