On the fundamental limits of coded caching and exact-repair regenerating codes Conference Paper uri icon

abstract

  • 2015 IEEE. The fundamental limits are investigated for (i) the problem of coded caching with N = 3 files and K = 3 users, and (ii) the problem of (5; 4; 4) exact-repair regenerating codes, i.e., there are n = 5 storage nodes where any k = 4 nodes can be used to recover the data, and any failed node can be repaired with d = 4 other nodes. A computational approach is adopted in this investigation which was developed by the author in an earlier work. For the first problem, an improved outer bound to the memory-delivery-rate tradeoff is obtained. For the second problem, a complete characterization of the storage-repair-bandwidth is provided. These results are part of the online collection of Solutions of Computed Information Theoretic Limits (SCITL).

name of conference

  • 2015 International Symposium on Network Coding (NetCod)

published proceedings

  • 2015 International Symposium on Network Coding (NetCod)

author list (cited authors)

  • Tian, C.

citation count

  • 7

complete list of authors

  • Tian, Chao

publication date

  • January 1, 2015 11:11 AM