Linear time encodable and list decodable codes
From MaRDI portal
Publication:3581290
DOI10.1145/780542.780562zbMath1192.94097OpenAlexW1994091697MaRDI QIDQ3581290
Piotr Indyk, Venkatesan Guruswami
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780562
Related Items (7)
Linear-time list recovery of high-rate expander codes ⋮ 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 ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments ⋮ List-Decoding with Double Samplers
This page was built for publication: Linear time encodable and list decodable codes
