TY - GEN

T1 - Permutation code

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

AU - Cadambe, Viveck R.

AU - Huang, Cheng

AU - Li, Jin

PY - 2011

Y1 - 2011

N2 - We consider exact repair of failed nodes in maximum distance separable (MDS) code based distributed storage systems. It is well known that an (n, k) MDS code can tolerate failure (erasure) of up to n - k storage disks, when the code is used to store k information elements over n distributed storage disks. The focus of this paper is optimal recovery, in terms of repair bandwidth - the amount of data to be downloaded to repair a failed node - for a single failed node. When a single node fails, it has been previously shown by Dimakis et. al. that the amount of repair bandwidth is at least L(n-1)/(n-k) units, when each storage disk stores L units of data. The achievability of this lower bound of L(n-1)/(n-k) units, for arbitrary values of (n, k); has been shown previously using asymptotic code constructions based on asymptotic interference alignment. However, the existence of finite codes satisfying this lower bound has been shown only for specific regimes of (n, k) and their existence for arbitrary values of (n, k) remained open. In this paper, we provide the first known construction of a finite code for arbitrary (n, k), which can repair a single failed systematic node by downloading exactly L(n-1)/(n-k) units of data. The code that we construct is based on permutation matrices and hence termed the Permutation Code.

AB - We consider exact repair of failed nodes in maximum distance separable (MDS) code based distributed storage systems. It is well known that an (n, k) MDS code can tolerate failure (erasure) of up to n - k storage disks, when the code is used to store k information elements over n distributed storage disks. The focus of this paper is optimal recovery, in terms of repair bandwidth - the amount of data to be downloaded to repair a failed node - for a single failed node. When a single node fails, it has been previously shown by Dimakis et. al. that the amount of repair bandwidth is at least L(n-1)/(n-k) units, when each storage disk stores L units of data. The achievability of this lower bound of L(n-1)/(n-k) units, for arbitrary values of (n, k); has been shown previously using asymptotic code constructions based on asymptotic interference alignment. However, the existence of finite codes satisfying this lower bound has been shown only for specific regimes of (n, k) and their existence for arbitrary values of (n, k) remained open. In this paper, we provide the first known construction of a finite code for arbitrary (n, k), which can repair a single failed systematic node by downloading exactly L(n-1)/(n-k) units of data. The code that we construct is based on permutation matrices and hence termed the Permutation Code.

UR - http://www.scopus.com/inward/record.url?scp=80054801912&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054801912&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2011.6033730

DO - 10.1109/ISIT.2011.6033730

M3 - Conference contribution

AN - SCOPUS:80054801912

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1225

EP - 1229

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -