On the list-decodability of random linear codes

DOI10.1145/1806689.1806747zbMath1293.94109arXiv1001.1386OpenAlexW2125708265WikidataQ56958862 ScholiaQ56958862MaRDI QIDQ2875168

Swastik Kopparty, Venkatesan Guruswami, Johan T. Håstad

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.1386

zbMATH Keywords

linear codesprobabilistic methodlist error-correctionlist decoding capacity

Mathematics Subject Classification ID

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

Related Items (1)

Nearly optimal property preserving hashing

This page was built for publication: On the list-decodability of random linear codes