Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes. (arXiv:1302.1256v1 [cs.IT])

from cs.IT updates on

Using the idea of interference alignment, Suh and Ramchandran constructed a
class of minimum-storage regenerating codes which can repair one systematic or
one parity-check node with optimal repair bandwidth. With the same code
structure, we show that in addition to single node failure, double node
failures can be repaired collaboratively with optimal repair bandwidth as well.
We give a detail description of how to repair multiple failures in the
Suh-Ramchandran regenerating code with six nodes, and sketch the proof for the
general case.



Fill in your details below or click an icon to log in: 徽标

You are commenting using your account. Log Out /  更改 )

Google+ photo

You are commenting using your Google+ account. Log Out /  更改 )

Twitter picture

You are commenting using your Twitter account. Log Out /  更改 )

Facebook photo

You are commenting using your Facebook account. Log Out /  更改 )


Connecting to %s