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

Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon. Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. In Aditya Bhaskara, Artur Czumaj, editors, Proceedings of the 58th Annual ACM Symposium on Theory of Computing, STOC 2026, Salt Lake City, UT, USA, June 22-26, 2026. pages 1409-1416, ACM, 2026. [doi]

Abstract

Abstract is missing.