Multi-layer transformed MDS codes achieve sub-packetization (d-k+1)^⌈n/((d-k+1)η)⌉ with optimal single-node repair access by restricting helper node choices, below the prior lower bound when η>1.
Distributed Storage Codes with Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization
Multi-layer transformed MDS codes achieve sub-packetization (d-k+1)^⌈n/((d-k+1)η)⌉ with optimal single-node repair access by restricting helper node choices, below the prior lower bound when η>1.