New constructions show that oblivious deletion codes can correct any constant number of deletions with redundancy close to the information-theoretic lower bound, beating known adversarial-code barriers.
List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
It is known that the Shannon capacity of the q-ary symmetric channel (qSC) is the same as the list-decoding capacity of an adversarial channel, raising the question of whether there is a formal (and black-box) connection between the two. We show that there is: Any linear code $C\subseteq \mathbb{F}_q^n$ that has minimum distance $d_{\min}=\omega(q^3)$ and achieves list-decoding capacity also achieves capacity on the qSC.
fields
cs.IT 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Oblivious Deletion Codes
New constructions show that oblivious deletion codes can correct any constant number of deletions with redundancy close to the information-theoretic lower bound, beating known adversarial-code barriers.