High-rate codes with sublinear-time decoding
DOI10.1145/1993636.1993660zbMATH Open1288.94112OpenAlexW2021999231MaRDI QIDQ5419086FDOQ5419086
Sergey Yekhanin, Shubhangi Saraf, Swastik Kopparty
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993660
polynomialsderivativeserror-correcting codeslocally decodable codessublinear-time algorithmsmultiplicity codes
Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35)
Cited In (12)
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
- Towards lower bounds on locally testable codes via density arguments
- Optimal Rate List Decoding via Derivative Codes
- Public Key Locally Decodable Codes with Short Keys
- Locality via Partially Lifted Codes
- Local correctability of expander codes
- A geometric approach to homomorphic secret sharing
- Composition of semi-LTCs by two-wise tensor products
- Locally Decodable Codes: A Brief Survey
- Locally Decodable Codes
- Fast systematic encoding of multiplicity codes
This page was built for publication: High-rate codes with sublinear-time decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419086)
