Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction
Distributed, Parallel, and Cluster Computing
2011-05-03 v1 Information Theory
math.IT
Abstract
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.
Cite
@article{arxiv.1105.0379,
title = {Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction},
author = {Frederique Oggier and Anwitaman Datta},
journal= {arXiv preprint arXiv:1105.0379},
year = {2011}
}
Comments
5 pages, 2 figures