2012/07/03 by Steve Jiekak, Nicolas Le Scouarnec, Jiekak, Steve +1
Computer Science · Mathematics · #Advanced Data Storage Technologies #Caching and Content Delivery #Distributed systems and fault tolerance #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1207.0854
ISIT 2012 - Recent Results Poster Session
arxiv created 2012/07/03 · openalex publication_date 2012/07/03 · arxiv updated 2012/07/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the exact and optimal repair of multiple failures in codes for distributed storage. More particularly, we provide an explicit construction of exact minimum bandwidth coordinated regenerating codes (MBCR) for n=d+t,k,d >= k,t >= 1. Our construction differs from existing constructions by allowing both t>1 (i.e., repair of multiple failures) and d>k (i.e., contacting more than k devices during repair).