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\).Cousin
- Product-matrix (PM) code— One of the two PM code constructions yields MSR codes for all \([n,k,d \ge 2k-2]\).
Member of code lists
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
- Victor V. Albert (2022-03-22) — most recent
Cite as:
“Minimum-storage regenerating (MSR) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/msr