Repair optimal erasure codes through hadamard designs

@article{Papailiopoulos2011RepairOE,
  title={Repair optimal erasure codes through hadamard designs},
  author={Dimitris Papailiopoulos and A. Dimakis and Viveck R. Cadambe},
  journal={2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
  year={2011},
  pages={1382-1389}
}
In distributed storage systems that employ erasure coding, the issue of minimizing the total communication required to exactly rebuild a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Designing high-rate maximum-distance separable (MDS) codes that achieve the optimum repair communication has been a well-known open problem. In this work, we use Hadamard matrices to construct the… Expand
154 Citations
Distributed storage codes through Hadamard designs
  • 23
  • PDF
Regenerating codes for errors and erasures in distributed storage
  • 91
  • PDF
Erasure coding for distributed storage: an overview
  • 36
  • PDF
Centralized multi-node repair for minimum storage regenerating codes
  • 16
  • PDF
Repair-optimal MDS array codes over GF(2)
  • 35
  • PDF
Optimal Locally Repairable Codes and Connections to Matroid Theory
  • 19
An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
  • 65
  • PDF
Exact-repair regenerating codes via layered erasure correction and block designs
  • 36
  • PDF
Cyclic repetition erasure code
  • Meng-Fei Zhang, S. Xia
  • Computer Science
  • 2013 3rd International Conference on Consumer Electronics, Communications and Networks
  • 2013
  • 2
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 51 REFERENCES
Distributed storage codes through Hadamard designs
  • 23
  • PDF
Rebuilding for array codes in distributed storage systems
  • 81
  • PDF
Explicit construction of optimal exact regenerating codes for distributed storage
  • 267
  • PDF
On codes for optimal rebuilding access
  • 79
  • PDF
Reducing repair traffic for erasure coding-based storage via interference alignment
  • Y. Wu, A. Dimakis
  • Computer Science
  • 2009 IEEE International Symposium on Information Theory
  • 2009
  • 186
  • PDF
Simple regenerating codes: Network coding for cloud storage
  • 186
  • PDF
Fractional repetition codes for repair in distributed storage systems
  • S. Rouayheb, K. Ramchandran
  • Computer Science, Mathematics
  • 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2010
  • 178
  • PDF
A Construction of Systematic MDS Codes With Minimum Repair Bandwidth
  • Y. Wu
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 2011
  • 59
  • PDF
Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
  • 238
  • PDF
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
  • 189
  • PDF
...
1
2
3
4
5
...