On locally decodable codes, self-correctable codes, and \(t\)-private PIR
type: Item
instance of: scholarly article
title: On locally decodable codes, self-correctable codes, and \(t\)-private PIR
zbMATH Open document ID: 1200.94055
author: Omer Barkol
author: Yuval Ishai
author: Enav Weinreb
published in: Algorithmica
publication date: 2010-11-08T00:00:00Z
Mathematics Subject Classification ID: 94B20
zbMATH DE Number: 5813797
zbMATH Keywords: locally decodable codes
zbMATH Keywords: self correctable codes
zbMATH Keywords: private information retrieval
zbMATH Keywords: \(t\)-Privacy
zbMATH Keywords: combinatorial designs
zbMATH Keywords: Reed Muller codes
zbMATH Keywords: Hamada's conjecture
MaRDI profile type: Publication
full work available at URL: s00453-008-9272-1
OpenAlex ID: W2126982151
cites work: Upper bound on the communication complexity of private information retrieval
cites work: Probabilistic checking of proofs
cites work: Proof verification and the hardness of approximation problems
cites work: Q4004114
cites work: Designs and codes: An update
cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
cites work: Q3359734
cites work: Q4535072
cites work: General constructions for information-theoretic private information retrieval
cites work: Q4718791
cites work: Designing programs that check their work
cites work: Minimum weight and dimension formulas for some geometric codes
cites work: Q4526995
cites work: Q4231909
cites work: Universal service-providers for private information retrieval
cites work: Minimum-weight codewords as generators of generalized Reed-Muller codes
cites work: Interactive proofs and the hardness of approximating cliques
cites work: Q3395988
cites work: On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
cites work: The geometric structure and the p-rank of an affine triple system derived from a nonassociative Moufang loop with the maximum associative center
cites work: Player simulation and general adversary structures in perfect multiparty computation
cites work: Improved upper bounds on information-theoretic private information retrieval (extended abstract)
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: On the efficiency of local decoding procedures for error-correcting codes
cites work: Q3355236
cites work: Extractors
cites work: Q3002789
cites work: How to share a secret
cites work: Pseudorandom generators without the XOR lemma
cites work: Linear perfect codes and a characterization of the classical designs
cites work: Some Applications of Coding Theory in Computational Complexity
cites work: Automata, Languages and Programming
cites work: A Geometric Approach to Information-Theoretic Private Information Retrieval
cites work: Q3549622
DOI: 10.1007/S00453-008-9272-1
description: scientific article; zbMATH DE number 5813797