The storage-repair-bandwidth trade-off of exact repair linear regenerating codes for the case d = k = n − 1

In this paper, we consider the setting of exact repair linear regenerating codes. Under this setting, we derive a new outer bound on the storage-repair-bandwidth trade-off for the case when d = k = n - 1, where (n; k; d) are parameters of the regenerating code, with their usual meaning. Taken together with the achievability result of Tian et. al. [1], we show that the new outer bound derived here completely characterizes the tradeoff for the case of exact repair linear regenerating codes, when d = k = n-1. The new outer bound is derived by analyzing the dual code of the linear regenerating code.

[1]  Toni Ernvall,et al.  Codes Between MBR and MSR Points With Exact Repair Property , 2013, IEEE Transactions on Information Theory.

[2]  Dimitris S. Papailiopoulos,et al.  Repair Optimal Erasure Codes Through Hadamard Designs , 2011, IEEE Transactions on Information Theory.

[3]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[4]  A. Robert Calderbank,et al.  New codes and inner bounds for exact repair in distributed storage systems , 2014, 2014 IEEE International Symposium on Information Theory.

[5]  Kannan Ramchandran,et al.  Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions , 2010, IEEE Transactions on Information Theory.

[6]  Kannan Ramchandran,et al.  Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff , 2010, IEEE Transactions on Information Theory.

[7]  P. Vijay Kumar,et al.  An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codes , 2013, 2014 IEEE International Symposium on Information Theory.

[8]  Chao Tian,et al.  Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs , 2014, IEEE Transactions on Information Theory.

[9]  Kannan Ramchandran,et al.  Exact-Repair MDS Code Construction Using Interference Alignment , 2011, IEEE Transactions on Information Theory.

[10]  P. Vijay Kumar,et al.  Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets , 2015, 2015 IEEE Information Theory Workshop (ITW).

[11]  Iwan M. Duursma.  Outer bounds for exact repair codes , 2014, ArXiv.

[12]  Jehoshua Bruck,et al.  Zigzag Codes: MDS Array Codes With Optimal Rebuilding , 2011, IEEE Transactions on Information Theory.

[13]  Nihar B. Shah,et al.  Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.

[14]  Kannan Ramchandran,et al.  Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage , 2013, IEEE Transactions on Information Theory.

[15]  Chao Tian.  Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes , 2014, IEEE Journal on Selected Areas in Communications.