On the list decodability of random linear codes with large error rates
From MaRDI portal
Publication:5495857
DOI10.1145/2488608.2488716zbMath1293.94115arXiv1302.2261OpenAlexW2130217481MaRDI QIDQ5495857
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2261
Related Items (6)
Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Restricted Isometry Property of Subsampled Fourier Matrices ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity
This page was built for publication: On the list decodability of random linear codes with large error rates