Rate region of the (4, 3, 3) exact-repair regenerating codes

@article{Tian2013RateRO,
  title={Rate region of the (4, 3, 3) exact-repair regenerating codes},
  author={Chao Tian},
  journal={2013 IEEE International Symposium on Information Theory},
  year={2013},
  pages={1426-1430}
}
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… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

51 Citations

01020'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

tributed storage codes with repair - by - transfer and non - achievability of interior points on the storage - bandwidth tradeoff

  • K. V. Rashmi Shah, P. V. Kumar, K. Ramchandran
  • IEEE Trans on Information Theory

Similar Papers

Loading similar papers…