Rashmi, KV and Ramchandran, Kannan and Kumar, Vijay P and Shah, Nihar B (2010) Explicit and Optimal Codes for Distributed Storage. TR-PME-2010-07.
Explicit_and_Optimal.pdf - Submitted Version
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.
|Item Type:||Departmental Technical Report|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||09 Nov 2011 06:09|
|Last Modified:||09 Nov 2011 06:09|
Actions (login required)