Batch and PIR Codes and Their Connections to Locally Repairable Codes

2016/11/29 by Vitaly Skachek, Skachek, Vitaly · 1 citation
Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Distributed systems and fault tolerance #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1611.09914

openalex publication_date 2016/11/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this survey, two related families of codes are discussed: batch codes and codes for private information retrieval. These two families can be viewed as natural generalizations of locally repairable codes, which were extensively studied in the context of coding for fault tolerance in distributed data storage systems. Bounds on the parameters of the codes, as well as basic constructions, are presented. Connections between different code families are discussed.

Cited by

• Tradeoffs on the volume of fault-tolerant circuits

Related

• Bounds and Constructions for Generalized Batch Codes
• Nearly Optimal Constructions of PIR and Batch Codes
• On an Equivalence Between Single-Server PIR with Side Information and\n Locally Recoverable Codes
• Explicit Constructions and Bounds for Batch Codes with Restricted Size of Reconstruction Sets
• Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes