scientific article; zbMATH DE number 7788438

DOI10.5555/3458064.3458164MaRDI QIDQ6147355zbMATH OpenFDO

Authors Tom Gur, Oded Lachish

Publication date 15 January 2024

Full work available at URL https://doi.org/10.5555/3458064.3458164

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Asymptotically-good RLCCs with \((\log n)^{2+o(1)}\) queries
• Linear relaxed locally decodable and correctable codes do not need adaptivity and two-sided error
• On the relaxed LDC of BGHSV: a survey that corrects the record
• On the lower bound on the length of relaxed locally decodable codes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147355)