2011/05/02 by Frédérique Oggier, Frederique Oggier, Anwitaman Datta +2
Computer Science · Mathematics · #Advanced Data Storage Technologies #Caching and Content Delivery #Cooperative Communication and Network Coding #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Information Theory (cs.IT) #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1105.0379
5 pages, 2 figures
arxiv created 2011/05/02 · openalex publication_date 2011/05/02 · arxiv updated 2011/05/03 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
Self-Repairing Codes (SRC) are codes designed to suit the need of coding for distributed networked storage: they not only allow stored data to be recovered even in the presence of node failures, they also provide a repair mechanism where as little as two live nodes can be contacted to regenerate the data of a failed node. In this paper, we propose a new instance of self-repairing codes, based on constructions of spreads coming from projective geometry. We study some of their properties to demonstrate the suitability of these codes for distributed networked storage.