An exponential lower bound on the sub-packetization of MSR codes (Q5212838)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7160571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exponential lower bound on the sub-packetization of MSR codes |
scientific article; zbMATH DE number 7160571 |
Statements
An exponential lower bound on the sub-packetization of MSR codes (English)
0 references
30 January 2020
0 references
cutset bound
0 references
distributed storage system (DSS)
0 references
MSR subspace families
0 references
maximum distance separable (MDS) vector codes
0 references
minimum storage regenerating (MSR) codes
0 references
repair bandwidth
0 references
sub-packetization
0 references
0.8318971991539001
0 references
0.7495431303977966
0 references
0.7431334853172302
0 references
0.736276388168335
0 references
0.7312353849411011
0 references
