Combinatorial bounds for list decoding

DOI10.1109/18.995539zbMath1061.94074OpenAlexW2154198326WikidataQ56958981 ScholiaQ56958981MaRDI QIDQ4674491

David Zuckerman, Madhu Sudan, Johan T. Håstad, Venkatesan Guruswami

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.995539

Mathematics Subject Classification ID

Combinatorial codes (94B25) Decoding (94B35)

Related Items

Robustly reusable fuzzy extractor with imperfect randomness ⋮ List Decoding of Binary Codes–A Brief Survey of Some Recent Results ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ Extractors from Reed-Muller codes ⋮ Explicit list-decodable codes with optimal rate for computationally bounded channels ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity