On the List-Decodability of Random Linear Codes
Work
Year: 2011
Type: article
Abstract: The list-decodability of random linear codes is shown to be as good as that of general random codes. Specifically, for every fixed finite field F <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xm... more
Institutions Carnegie Mellon University, KTH Royal Institute of Technology, Institute for Advanced Study, IIT@MIT
Cites: 15
Cited by: 45
Related to: 10
FWCI: 6.45
Citation percentile (by year/subfield): 98.07
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green