On the List-Decodability of Random Linear Codes

DOI10.1109/TIT.2010.2095170MaRDI QIDQ5281072zbMATH OpenOpenAlexWikidataFDO

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

(15)

• On list decoding of certain \(\mathbb{F}_q\)-linear codes
• Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
• Linear time encodable and list decodable codes
• List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
• Improved list-decodability of random linear binary codes
• Low-density parity-check codes achieve list-decoding capacity
• scientific article; zbMATH DE number 7559374 (Why is no real title available?)
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
• Pseudorandom linear codes are list-decodable to capacity
• A criterion for decoding on the binary symmetric channel
• Sharp threshold rates for random codes
• A simplified reduction for error correcting matrix multiplication algorithms
• Near-optimal list-recovery of linear code families
• List-recovery of random linear codes over small fields

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)