On the list decodability of random linear codes with large error rates

DOI10.1145/2488608.2488716zbMath1293.94115arXiv1302.2261OpenAlexW2130217481MaRDI QIDQ5495857

Mary Wootters

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

zbMATH Keywords

list decodingrandom linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

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