Explicit capacity-achieving list-decodable codes
From MaRDI portal
Publication:2931364
DOI10.1145/1132516.1132518zbMATH Open1301.94157OpenAlexW1996584657MaRDI QIDQ2931364FDOQ2931364
Authors: 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
Recommendations
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Combinatorial bounds for list decoding
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Two theorems on list decoding (extended abstract)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
Cited In (13)
- List-decoding Barnes-Wall lattices
- Evading subspaces over large fields and explicit list-decodable rank-metric codes
- 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
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- Explicit list-decodable codes with optimal rate for computationally bounded channels
- List-decoding multiplicity codes
- Improvements on the Johnson bound for Reed-Solomon codes
- Collision resistance from multi-collision resistance for all constant parameters
- On the error-correcting radius of folded Reed-Solomon code designs
- Explicit List-decodable codes with optimal rate for computationally bounded channels
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
This page was built for publication: Explicit capacity-achieving list-decodable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931364)
