Random linear codes over small fields achieve list-recovery list size O(1/ε) at rate ε below capacity, improving the Zyablov-Pinsker q^{O(ℓ/ε)} bound for erasures over prime fields and for errors over all fields.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
List-Recovery of Random Linear Codes over Small Fields
Random linear codes over small fields achieve list-recovery list size O(1/ε) at rate ε below capacity, improving the Zyablov-Pinsker q^{O(ℓ/ε)} bound for erasures over prime fields and for errors over all fields.