Referenced Items are not available for this document.
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.
Published in:
Information Theory Workshop (ITW), 2011 IEEE
Date of Conference: 16-20 Oct. 2011
- Page(s):
- 30 - 34
- Print ISBN:
- 978-1-4577-0438-3
- INSPEC Accession Number:
- 12405993
- Conference Location :
- Paraty
- Digital Object Identifier :
- 10.1109/ITW.2011.6089443
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
