  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.
