Alphabet-permutation codes achieve the optimal list-recovery tradeoff of random codes with only polynomially many random bits.
Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Z entrum f¨ ur Informatik, 2022, 55:1–55:17
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes
Alphabet-permutation codes achieve the optimal list-recovery tradeoff of random codes with only polynomially many random bits.