Rate region of the (4, 3, 3) exact-repair regenerating codes
Author:
- 1 July 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1426-1430
Abstract
Exact-repair regenerating codes are considered for the case (n, k, d) = (4, 3,3), for which a complete characterization of the rate region is provided. This characterization answers in the affirmative the open question whether there exists a non-vanishing gap between the optimal bandwidth-storage tradeoff of the functional-repair regenerating codes (i.e., the cut-set bound) and that of the exact-repair regenerating codes. The converse proof relies on the existence of symmetric optimal solutions. For the achievability, only one non-trivial corner point of the rate region needs to be addressed, for which an explicit binary code construction is given.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed StorageIEEE Transactions on Information Theory, 2013
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code ConstructionsIEEE Transactions on Information Theory, 2011
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth TradeoffIEEE Transactions on Information Theory, 2011
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix ConstructionIEEE Transactions on Information Theory, 2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Linear network codingIEEE Transactions on Information Theory, 2003
- A First Course in Information Theory2002
- Network information flowIEEE Transactions on Information Theory, 2000