Locally Decodable Codes: A Brief Survey

DOI10.1007/978-3-642-20901-7_18zbMath1271.94030MaRDI QIDQ3005596

Sergey Yekhanin

Publication date: 8 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20901-7_18

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

94B99: Theory of error-correcting codes and error-detecting codes

Related Items

Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes, A novel elementary construction of matching vectors, Another generalisation of the binary Reed-Muller codes and its applications, Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes, Enumerative coding for line polar Grassmannians with applications to codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
• Query-efficient locally decodable codes of subexponential length
• Pseudorandom generators without the XOR Lemma (extended abstract)
• Matching Vector Codes
• On the efficiency of local decoding procedures for error-correcting codes
• Towards 3-query locally decodable codes of subexponential length
• 3-query locally decodable codes of subexponential length
• High-rate codes with sublinear-time decoding
• Locally Decodable Codes