Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets

DOI10.1145/509907.510023zbMath1192.94132OpenAlexW2068096733MaRDI QIDQ3579197

Venkatesan Guruswami, Piotr Indyk

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.510023

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (8)

Linear-time list recovery of high-rate expander codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments

This page was built for publication: Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets