This shows you the differences between two versions of the page.
papers:regenerating_codes_for_errors_and_erasures_in_distributed_storage [2012/07/11 11:09] (current)
|Line 1:||Line 1:|
|+||We address the fundamental problem of handling errors and erasures during the data-reconstruction and node-repair operations. We provide explicit regenerating codes that are resilient to errors and erasures, and show that these codes are optimal with respect to storage and bandwidth requirements. As a special case, we also establish the capacity of a class of distributed storage systems in the presence of malicious adversaries. While our code constructions are based on previously constructed Product-matrix codes, we also provide necessary and sufficient conditions for introducing resilience in any regenerating code.|