On Locality in Distributed Storage Systems. (arXiv:1204.6098v1 [cs.IT])

from cs.IT updates on arXiv.org http://arxiv.org/abs/1204.6098

This paper studies the design of codes for distributed storage systems (DSS)
that enable local repair in the event of node failure. This paper presents
locally repairable codes based on low degree multivariate polynomials. Its code
construction mechanism extends work on Noisy Interpolating Set by Dvir et al.
\cite{dvir2011}. The paper presents two classes of codes that allow node repair
to be performed by contacting 2 and 3 surviving nodes respectively. It further
shows that both classes are good in terms of their rate and minimum distance,
and allow their rate to be bartered for greater flexibility in the repair



Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / 更改 )

Twitter picture

You are commenting using your Twitter account. Log Out / 更改 )

Facebook photo

You are commenting using your Facebook account. Log Out / 更改 )

Google+ photo

You are commenting using your Google+ account. Log Out / 更改 )

Connecting to %s