Locally decodable codes and private information retrieval schemes.
From MaRDI portal
Publication:983163
DOI10.1007/978-3-642-14358-8zbMath1211.68181OpenAlexW2105537253MaRDI QIDQ983163
Publication date: 3 August 2010
Published in: Information Security and Cryptography (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/42242
Linear codes (general theory) (94B05) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items
Enumerative coding for line polar Grassmannians with applications to codes ⋮ A quadratic lower bound for three-query linear locally decodable codes over any field ⋮ A novel elementary construction of matching vectors ⋮ A new multi-server scheme for private information retrieval ⋮ Information hiding using matroid theory ⋮ Local correction with constant error rate