[Jump to code hierarchy]

Minimum-storage regenerating (MSR) code

Description

A regenerating code that corresponds to the minimum-storage extreme point of the storage-bandwidth trade-off curve, characterized by \(\alpha = (d-k+1)\beta\).

Cousin

Primary Hierarchy

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

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

Zoo Code ID: msr

Cite as:
“Minimum-storage regenerating (MSR) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/msr, arXiv:2606.11484
BibTeX:
@incollection{eczoo_msr,
title={Minimum-storage regenerating (MSR) code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
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.), 2026. https://errorcorrectionzoo.org/c/msr, arXiv:2606.11484

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