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.
MDS Generalized Convertible Code
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2verdicts
UNVERDICTED 2representative citing papers
New linear-algebraic lower bounds on conversion bandwidth for MDS convertible codes that are tight for r^F ≤ r^I ≤ k^F.
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.
-
Lower Bounds on Conversion Bandwidth for MDS Convertible Codes in Split Regime
New linear-algebraic lower bounds on conversion bandwidth for MDS convertible codes that are tight for r^F ≤ r^I ≤ k^F.