An exponential lower bound on the sub-packetization of MSR codes (Q5212838): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963582720 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1901.05112 / rank | |||
Normal rank | |||
Latest revision as of 00:53, 20 April 2024
scientific article; zbMATH DE number 7160571
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
