2023/09/30 by Phuc-Lu Le, Son Hoang Dau, Le, Phuc-Lu +5
Computer Science · #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Information Theory (cs.IT) #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2310.00467
openalex publication_date 2023/09/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate in this work the problem of Erasure Combinatorial Batch Codes, in which n files are stored on m servers so that every set of n-r servers allows a client to retrieve at most k distinct files by downloading at most t files from each server. Previous studies have solved this problem for the special case of t=1 using Combinatorial Batch Codes. We tackle the general case t ≥ 1 using a generalization of Hall's theorem. Additionally, we address a realistic scenario in which the retrieved files are consecutive according to some order and provide a simple and optimal solution for this case.