Constructs constant-rate ε-MSR Reed-Solomon codes with sub-packetization n^{O(1/ε)}, trading a small bandwidth overhead for polynomial sub-packetization.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization
Constructs constant-rate ε-MSR Reed-Solomon codes with sub-packetization n^{O(1/ε)}, trading a small bandwidth overhead for polynomial sub-packetization.