Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ELENA GRIGORESCU:
All reports by Author Elena Grigorescu:

TR25-208 | 25th November 2025
Elena Grigorescu, Vinayak Kumar, Peter Manohar, Geoffrey Mon

Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes

A locally decodable code (LDC) $C: \{0,1\}^k \to \{0,1\}^n$ is an error-correcting code that allows one to recover any bit of the original message with good probability while only reading a small number of bits from a corrupted codeword. A relaxed locally decodable code (RLDC) is a weaker notion where ... more >>>




ISSN 1433-8092 | Imprint