dc.contributor.authorOggier, Frederique
dc.contributor.authorDatta, Anwitaman
dc.identifier.citationOggier, F., & Datta, A. (2011). Self-repairing codes for distributed storage : a projective geometric construction. IEEE Information Theory Workshop.
dc.description.abstractSelf-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.en_US
dc.format.extent5 p.en_US
dc.rights© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
dc.subjectDRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
dc.titleSelf-repairing codes for distributed storage : a projective geometric constructionen_US
dc.typeConference Paper
dc.contributor.conferenceIEEE Information Theory Workshop (10th : 2011 : Paraty, Brazil)en_US
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.description.versionAccepted versionen_US
dc.contributor.organizationSingapore National Research Foundationen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record