Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage

@article{Cadambe2013AsymptoticIA,
  title={Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage},
  author={V. Cadambe and S. Jafar and H. Maleki and K. Ramchandran and Changho Suh},
  journal={IEEE Transactions on Information Theory},
  year={2013},
  volume={59},
  pages={2974-2987}
}
The high repair bandwidth cost of (<i>n</i>,<i>k</i>) maximum distance separable (MDS) erasure codes has motivated a new class of codes that can reduce repair bandwidth over that of conventional MDS codes. In this paper, we address (<i>n</i>,<i>k</i>,<i>d</i>) exact repair MDS codes, which allow for any single failed node to be repaired exactly with access to any arbitrary set of <i>d</i> survivor nodes. We show the existence of exact repair MDS codes that achieve minimum repair bandwidth… Expand
177 Citations
Access vs. bandwidth in codes for storage
  • 22
  • PDF
New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n))
  • Min Ye
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 2020
  • PDF
Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth
  • Min Ye, A. Barg
  • Mathematics, Computer Science
  • 2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
  • 39
  • PDF
Polynomial length MDS codes with optimal repair in distributed storage
  • V. Cadambe, C. Huang, J. Li, S. Mehrotra
  • Computer Science, Mathematics
  • 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)
  • 2011
  • 57
  • PDF
A new sub-packetization bound for minimum storage regenerating codes
  • 10
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
  • 25
  • PDF
Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
  • Min Ye, A. Barg
  • Computer Science
  • IEEE Transactions on Information Theory
  • 2019
  • 26
Explicit Constructions of Optimal-Access MSCR Codes for All Parameters
Improved schemes for asymptotically optimal repair of MDS codes
  • Ameera Chowdhury, A. Vardy
  • Computer Science, Mathematics
  • 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2017
  • 20
  • PDF
Centralized multi-node repair for minimum storage regenerating codes
  • 16
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 45 REFERENCES
Exact-Repair MDS Code Construction Using Interference Alignment
  • 172
  • PDF
Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems
  • V. Cadambe, C. Huang, J. Li
  • Computer Science, Mathematics
  • 2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
  • 76
Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignment
  • 53
  • PDF
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
  • 189
  • PDF
Polynomial length MDS codes with optimal repair in distributed storage
  • V. Cadambe, C. Huang, J. Li, S. Mehrotra
  • Computer Science, Mathematics
  • 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)
  • 2011
  • 57
  • PDF
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
  • 563
  • PDF
Distributed storage codes through Hadamard designs
  • 23
  • PDF
Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems
  • K. Shum, Y. Hu
  • Computer Science, Mathematics
  • 2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
  • 49
  • PDF
Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
  • 238
  • PDF
...
1
2
3
4
5
...