By Topic

Explicit codes minimizing repair bandwidth for distributed storage

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nihar B. Shah ; Dept. of ECE, Indian Institute Of Science, Bangalore, India ; K. V. Rashmi ; P. Vijay Kumar ; Kannan Ramchandran

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.

Published in:

Information Theory (ITW 2010, Cairo), 2010 IEEE Information Theory Workshop on

Date of Conference:

6-8 Jan. 2010