Defines maximally recoverable LRCs with locality and availability for t>1, identifies correctable global erasure patterns (all of them when t=1), gives three MSRD-based constructions with smallest field sizes in some regimes, and extends finite-field lower bounds to any t.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Maximally recoverable codes with locality and availability
Defines maximally recoverable LRCs with locality and availability for t>1, identifies correctable global erasure patterns (all of them when t=1), gives three MSRD-based constructions with smallest field sizes in some regimes, and extends finite-field lower bounds to any t.