On the Fundamental Limits of Coded Caching and Exact-Repair Regenerating Codes Conference Paper

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)

authors

• Tian, Chao

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

• August 2015

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• 2015 INTERNATIONAL SYMPOSIUM ON NETWORK CODING (NETCOD)  Journal

keywords

• Caching
• Fundamental Limits
• Information Inequality
• Regenerating Codes

Digital Object Identifier (DOI)

• 10.1109/netcod.2015.7176789

International Standard Book Number (ISBN) 13

• 9781479919116

start page

• 56

end page

• 60

URL

• http://dx.doi.org/10.1109/netcod.2015.7176789