Rate Region of the (4, 3, 3) Exact-Repair Regenerating Codes Conference Paper uri icon


  • 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. 2013 IEEE.

name of conference

  • 2013 IEEE International Symposium on Information Theory

published proceedings

  • 2013 IEEE International Symposium on Information Theory

author list (cited authors)

  • Tian, C.

complete list of authors

  • Tian, Chao

publication date

  • January 1, 2013 11:11 AM