On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR

DOI10.1007/978-3-540-74208-1_23zbMath1171.94373OpenAlexW2294076223MaRDI QIDQ3603474

Yuval Ishai, Enav Weinreb, Omer Barkol

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_23

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decoding (94B35)

Related Items (4)

CNF-FSS and Its Applications ⋮ Communication-efficient distributed oblivious transfer ⋮ On matrix rigidity and locally self-correctable codes ⋮ IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM

This page was built for publication: On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR