REVIEW 1 cited by
List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.