Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
From MaRDI portal
Publication:5144940
DOI10.1145/3357713.3384295zbMath1492.94218arXiv1911.01502OpenAlexW3035375942MaRDI QIDQ5144940
Publication date: 19 January 2021
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.01502
Related Items (4)
Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results
This page was built for publication: Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius