By Topic

Explicit and optimal codes 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
$31 $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)
Rashmi, K.V. ; Dept. of ECE, Indian Inst. Of Sci., Bangalore, India ; Shah, N.B. ; Kumar, P.V. ; Ramchandran, K.

In the distributed storage coding problem we consider, data is stored across n nodes in a network, each capable of storing ¿ symbols. It is required that the complete data can be reconstructed by downloading data from any k nodes. There is also the key additional requirement that a failed node be regenerated by connecting to any d nodes and downloading ß symbols from each of them. Our goal is to minimize the repair bandwidth dß. In this paper we provide explicit constructions for several parameter sets of interest.

Published in:

Information Theory and Applications Workshop (ITA), 2010

Date of Conference:

Jan. 31 2010-Feb. 5 2010