Coded caching is a new approach to decrease the communication load during the peak hours of the network. It provides a significant gain, that is maximized in the centralized setting, where the server controls the placement. In many situations, each user fills its cache without any information about the placement of other users. We show that subspace precoding for placement improves the delivery load of a decentralized caching system compared to uncoded placement. Surprisingly, the proposed scheme achieves the delivery load of the centralized placement for K = 3 users for the entire range of cache size.
|Original language||English (US)|
|Title of host publication||2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||5|
|State||Published - Jul 2019|
|Event||2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France|
Duration: Jul 7 2019 → Jul 12 2019
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Conference||2019 IEEE International Symposium on Information Theory, ISIT 2019|
|Period||7/7/19 → 7/12/19|
Bibliographical noteFunding Information:
This work is supported in part by the National Science Foundation under Grant CCF-1749981.