A Novel Asymmetric Coded Placement in Combination Networks with End-User Caches

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.