abstract—the tradeoff between the user’s memory size and the
worst-case download time in the (h, r, m, n) combination network
is studied, where a central server communicates with k users
through h immediate relays, and each user has local cache of
size m files and is connected to a different subset of r relays.
the main contribution of this paper is the design of a coded
caching scheme with asymmetric coded placement by leveraging
coordination among the relays, which was not exploited in past
work. mathematical analysis and numerical results show that the
proposed schemes outperform existing schemes.