Linear programming bounds for distributed storage codes (Q2176298)
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 7195891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear programming bounds for distributed storage codes |
scientific article; zbMATH DE number 7195891 |
Statements
Linear programming bounds for distributed storage codes (English)
0 references
4 May 2020
0 references
distributed storage network
0 references
erasure code
0 references
linear programming
0 references
locally repairable code
0 references
update complexity
0 references
0.92206526
0 references
0.8910438
0 references
0.89045846
0 references
0.88695645
0 references
0.8815321
0 references
0.8791833
0 references
0.8781474
0 references
0.87613153
0 references
