On the List-Decodability of Random Linear Codes

DOI10.1109/TIT.2010.2095170MaRDI QIDQ5281072zbMATHOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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

Cited in

(9)

• Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
• Low-density parity-check codes achieve list-decoding capacity
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 7559374 (Why is no real title available?)
• On list decoding of certain \(\mathbb{F}_q\)-linear codes
• Improved list-decodability of random linear binary codes
• List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
• 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)