[Jump to code hierarchy]

Minimum-bandwidth regenerating (MBR) code

Description

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

Cousin

Member of code lists

Primary Hierarchy

Classical Domain
Matrix Kingdom
Matrix-based codeECC
Array codeDistributed-storage ECC
Regenerating code (RGC)Distributed-storage ECC
Parents
Regenerating code (RGC)
MBR codes are minimum-bandwidth extreme points in the storage-bandwidth trade-off curve and are characterized by \(\alpha = d\beta\).
Minimum-bandwidth regenerating (MBR) code
Page edit log

Your contribution is welcome!

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

edit on this site

Zoo Code ID: mbr

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

Cite as:

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

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