Rate Region of the (4,3,3) Exact-Repair Regenerating Codes

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.

accepted, ISIT 2013, 5 pages

References in corpus (2)

• Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
• Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Cited by in corpus (5)

• Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes
• Multilevel Diversity Coding Systems: Rate Regions, Codes, Computation, & Forbidden Minors
• A Connection Between Locally Repairable Codes and Exact Regenerating Codes
• New Codes and Inner Bounds for Exact Repair in Distributed Storage Systems
• Symmetry in Distributed Storage Systems