Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2
暂无分享,去创建一个
[1] Michael Gastpar,et al. K users caching two files: An improved achievable rate , 2016, 2016 Annual Conference on Information Science and Systems (CISS).
[2] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[3] Zhi Chen. Fundamental Limits of Caching: Improved Bounds For Small Buffer Users , 2014, ArXiv.
[4] Michèle Wigger,et al. Noisy Broadcast Networks With Receiver Caching , 2016, IEEE Transactions on Information Theory.
[5] Mohammad Ali Maddah-Ali,et al. Cache-aided interference management in wireless cellular networks , 2017, 2017 IEEE International Conference on Communications (ICC).
[6] Jesús Gómez-Vilardebó. Fundamental Limits of Caching: Improved Bounds with Coded Prefetching , 2016, ArXiv.
[7] Urs Niesen,et al. Coded Caching With Nonuniform Demands , 2017, IEEE Transactions on Information Theory.
[8] Urs Niesen,et al. Cache-aided interference channels , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[9] T. Charles Clancy,et al. Improved approximation of storage-rate tradeoff for caching via new outer bounds , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[10] Mohammad Mohammadi Amiri,et al. Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off , 2016 .
[11] Urs Niesen,et al. Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[12] Hooshang Ghasemi,et al. Improved lower bounds for coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[13] Kai Wan. On Caching with More Users than Files , 2018 .
[14] Petros Elia,et al. Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback , 2015, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[15] Michael Gastpar,et al. A new converse bound for coded caching , 2016, 2016 Information Theory and Applications Workshop (ITA).
[16] Michael Gastpar,et al. Information theoretic caching: The multi-user case , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[17] A. Salman Avestimehr,et al. Cache-Aided Interference Management in Wireless Cellular Networks , 2019, IEEE Transactions on Communications.
[18] Suhas N. Diggavi,et al. Multi-level coded caching , 2014, 2014 IEEE International Symposium on Information Theory.
[19] Xinbing Wang,et al. Coded caching under arbitrary popularity distributions , 2015, 2015 Information Theory and Applications Workshop (ITA).
[20] Giuseppe Caire,et al. Fundamental Limits of Caching in Wireless D2D Networks , 2014, IEEE Transactions on Information Theory.
[21] Suhas N. Diggavi,et al. Hierarchical coded caching , 2014, 2014 IEEE International Symposium on Information Theory.
[22] A. Salman Avestimehr,et al. The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching , 2016, IEEE Transactions on Information Theory.
[23] Chao Tian,et al. Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).
[24] Mohammad Ali Maddah-Ali,et al. Fundamental limits of cache-aided interference management , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[25] Urs Niesen,et al. Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.
[26] Jaime Llorca,et al. Order-Optimal Rate of Caching and Coded Multicasting With Random Demands , 2015, IEEE Transactions on Information Theory.
[27] Urs Niesen,et al. Online coded caching , 2014, ICC.
[28] Deniz Gündüz,et al. Coded caching for a large number of users , 2016, 2016 IEEE Information Theory Workshop (ITW).
[29] Mohammad Ali Maddah-Ali,et al. Characterizing the rate-memory tradeoff in cache networks within a factor of 2 , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).