On the List-Decodability of Random Linear Codes
From MaRDI portal
Publication:5281072
DOI10.1109/TIT.2010.2095170zbMATH Open1366.94699OpenAlexW3149161352WikidataQ56958828 ScholiaQ56958828MaRDI QIDQ5281072FDOQ5281072
Authors: Swastik Kopparty, Venkatesan Guruswami, Johan Hastad 
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2010.2095170
Cited In (9)
- Title not available (Why is that?)
- List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Low-density parity-check codes achieve list-decoding capacity
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- Improved list-decodability of random linear binary codes
- On list decoding of certain \(\mathbb{F}_q\)-linear codes
- Linear time encodable and list decodable codes
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
This page was built for publication: On the List-Decodability of Random Linear Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281072)
