Explicit capacity-achieving list-decodable codes
From MaRDI portal
Publication:2931364
DOI10.1145/1132516.1132518zbMath1301.94157OpenAlexW1996584657MaRDI QIDQ2931364
Atri Rudra, Venkatesan Guruswami
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132518
Related Items (5)
List-decoding Barnes-Wall lattices ⋮ Efficient List Decoding of Explicit Codes with Optimal Redundancy ⋮ Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ Improvements on the Johnson bound for Reed-Solomon codes
This page was built for publication: Explicit capacity-achieving list-decodable codes
