Skip to Main Content
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.
Information Theory and Applications Workshop (ITA), 2010
Date of Conference: Jan. 31 2010-Feb. 5 2010