Minimum-storage regenerating (MSR) code 

Description

An RGC that corresponds to an extreme point in the storage-bandwidth trade-off curve that is characterised by \(\alpha = (d-k+1)\beta\).

Parents

  • Regenerating code (RGC) — MSR codes are extreme points in the storage-bandwidth trade-off curve and are characterised by \(\alpha = (d-k+1)\beta\).
  • MDS array code — MSR codes are MDS array codes; e.g., see [1].

Child

Cousin

References

[1]
V. Ramkumar, N. Raviv, and I. Tamo, “\(\varepsilon\)-MSR Codes for Any Set of Helper Nodes”, (2024) arXiv:2408.16584
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: msr

Cite as:
“Minimum-storage regenerating (MSR) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/msr
BibTeX:
@incollection{eczoo_msr, title={Minimum-storage regenerating (MSR) code}, booktitle={The Error Correction Zoo}, year={2022}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/msr} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/msr

Cite as:

“Minimum-storage regenerating (MSR) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/msr

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/matrices/regenerating/msr.yml.