Explicit codes minimizing repair bandwidth for distributed storage

Shah, NB and Rashmi, KV and Kumar, PV and Ramchandran, K (2010) Explicit codes minimizing repair bandwidth for distributed storage. In: 2010 IEEE Information Theory Workshop (ITW), 6-8 Jan. 2010, Cairo.

PDF Explicit.pdf - Published Version Restricted to Registered users only Download (585kB) | Request a copy

Abstract

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 2010 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	20 Dec 2011 06:32
Last Modified:	20 Dec 2011 06:32
URI:	http://eprints.iisc.ac.in/id/eprint/39049

Actions (login required)

View Item