Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > CONSISTENCY TEST USING RANDOM WALK:
Reports tagged with Consistency test using random walk:
TR20-142 | 15th September 2020
Locally decodable codes (LDCs) are error-correcting codes $C : \Sigma^k \to \Sigma^n$ that admit a local decoding algorithm that recovers each individual bit of the message by querying only a few bits from a noisy codeword. An important question in this line of research is to understand the optimal trade-off ... more >>>