Derives information-theoretic lower bounds on conversion bandwidth for systematic optimal-distance LRC convertible codes in the global merge regime, proving optimality of Maturana-Rashmi constructions without linearity assumptions.
Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bandwidth Cost of Locally Repairable Convertible Codes in the Global Merge Regime
Derives information-theoretic lower bounds on conversion bandwidth for systematic optimal-distance LRC convertible codes in the global merge regime, proving optimality of Maturana-Rashmi constructions without linearity assumptions.