Private information retrieval (PIR) protocols allow a user to retrieve a data item from a
database without revealing any information about the identity of the item being retrieved …

In this paper, we study two families of codes with availability, namely, private information
retrieval (FIR) codes and batch codes. While the former requires that every information …

We consider the storage-retrieval rate tradeoff in private information retrieval systems using
a Shannon-theoretic approach. Our focus is on the canonical two-message two-database …

In the classical model for (information theoretically secure) Private Information Retrieval
(PIR) due to Chor, Goldreich, Kushilevitz and Sudan, a user wishes to retrieve one bit of a …

We study array codes which are based on subspaces of a linear space over a finite field,
using spreads, q-Steiner systems, and subspace transversal designs. We present several …

Private information retrieval (PIR) codes and batch codes are two important types of codes
that are designed for coded distributed storage systems and private information retrieval …

A functional k-Private Information Retrieval (k-PIR) code of dimension s consists of n servers
storing linear combinations of s linearly independent information symbols. Any linear …

Locally Repairable codes (LRCs) have gained significant interest due to applications in
distributed storage systems since they enable systems to recover a failed node by accessing …

In this work private information retrieval (PIR) codes are studied. In ak-PIR code, s
information bits are encoded in such a way that every information bit has k mutually disjoint …

Batch codes are a type of codes specifically designed for coded distributed storage systems
and private information retrieval protocols. These codes have got much attention in recent …