List-Decoding Capacity Implies Capacity on the š-ary Symmetric Channel
Name
3717823.3718206.pdf
Size
749.02 KB
Format
Adobe PDF
Checksum (MD5)
a73bc4bde0dd92549f2e56dd081191ef
Author(s)
Pernice, Francisco
Sprumont, Oscar
Wootters, Mary
Date Issued
June 15, 2025
Publisher
ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing
Citation
Francisco Pernice, Oscar Sprumont, and Mary Wootters. 2025. List-Decoding Capacity Implies Capacity on the š-ary Symmetric Channel. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC '25). Association for Computing Machinery, New York, NY, USA, 855ā866.
Version
Final published version
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ā Fqn that has superconstant minimum distance and achieves list-decoding capacity also achieves capacity on the qSC.
Description
STOC ā25, Prague, Czechia
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3717823.3718206
