updates
This commit is contained in:
@@ -181,7 +181,7 @@ Regenerating codes, Magic #2:
|
||||
- Both decreasing functions of $d$.
|
||||
- $\Rightarrow$ Less repair-bandwidth by contacting more nodes, minimized at $d = n - 1$.
|
||||
|
||||
### Constructing Minimum bandwidth regenerating (MBR) codes from Minimum distance codes
|
||||
### Constructing Minimum bandwidth regenerating (MBR) codes from Maximum distance separable (MDS) codes
|
||||
|
||||
Observation: For MBR code with parameters $n, k, d$ and $\beta = 1$, one can construct MBR with parameters $n, k, d$ and any $\beta$.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user