Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching
暂无分享,去创建一个
[1] Chao Tian,et al. Latent Capacity Region: A Case Study on Symmetric Broadcast With Common Messages , 2009, IEEE Transactions on Information Theory.
[2] Frank Harary,et al. Graph Theory As A Mathematical Model In Social Science , 1953 .
[3] Urs Niesen,et al. Online coded caching , 2014, ICC.
[4] Kai Zhang,et al. On the Symmetry Reduction of Information Inequalities , 2018, IEEE Transactions on Communications.
[5] Deniz Gündüz,et al. Coded caching for a large number of users , 2016, 2016 IEEE Information Theory Workshop (ITW).
[6] Raymond W. Yeung,et al. Symmetrical multilevel diversity coding , 1997, IEEE Trans. Inf. Theory.
[7] Hooshang Ghasemi,et al. Improved lower bounds for coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[8] Daniela Tuninetti,et al. On caching with more users than files , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[9] Randall Dougherty,et al. Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.
[10] Vinod M. Prabhakaran,et al. Critical database size for effective caching , 2015, 2015 Twenty First National Conference on Communications (NCC).
[11] Urs Niesen,et al. Coded Caching With Nonuniform Demands , 2017, IEEE Trans. Inf. Theory.
[12] Raymond W. Yeung,et al. A First Course in Information Theory , 2002 .
[13] Zhen Zhang,et al. A non-Shannon-type conditional inequality of information quantities , 1997, IEEE Trans. Inf. Theory.
[14] Zhi Chen,et al. Fundamental limits of caching: improved bounds for users with small buffers , 2016, IET Commun..
[15] Chee Wei Tan,et al. Proving and disproving information inequalities , 2014, 2014 IEEE International Symposium on Information Theory.
[16] Jaime Llorca,et al. Order-Optimal Rate of Caching and Coded Multicasting With Random Demands , 2015, IEEE Transactions on Information Theory.
[17] John Stillwell,et al. Symmetry , 2000, Am. Math. Mon..
[18] Jesús Gómez-Vilardebó,et al. Fundamental Limits of Caching: Improved Rate-Memory Tradeoff With Coded Prefetching , 2018, IEEE Transactions on Communications.
[19] 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).
[20] Urs Niesen,et al. Coded Caching With Nonuniform Demands , 2017, IEEE Transactions on Information Theory.
[21] Chao Tian. Symmetry, demand types and outer bounds in caching systems , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[22] Zhen Zhang,et al. On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.
[23] Michele A. Wigger,et al. Improved converses and gap-results for coded caching , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[24] Chao Tian. A Note on the Rate Region of Exact-Repair Regenerating Codes , 2015, ArXiv.
[25] Urs Niesen,et al. Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.
[26] Chao Tian,et al. Multilevel Diversity Coding With Regeneration , 2016, IEEE Trans. Inf. Theory.
[27] Zhi Chen. Fundamental Limits of Caching: Improved Bounds For Small Buffer Users , 2014, ArXiv.
[28] 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).
[29] Jun Chen,et al. A Lower Bound on the Sum Rate of Multiple Description Coding With Symmetric Distortion Constraints , 2014, IEEE Transactions on Information Theory.
[30] Michael Gastpar,et al. K users caching two files: An improved achievable rate , 2016, 2016 Annual Conference on Information Science and Systems (CISS).
[31] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[32] Jayant Apte,et al. Exploiting symmetry in computing polyhedral bounds on network coding rate regions , 2015, 2015 International Symposium on Network Coding (NetCod).
[33] B. Donald,et al. Quantifier Elimination for Conjunctions of Linear Constraints via a Convex Hull Algorithm , 2013 .
[34] John MacLaren Walsh,et al. Multilevel Diversity Coding Systems: Rate Regions, Codes, Computation, & Forbidden Minors , 2014, IEEE Transactions on Information Theory.
[35] A. Salman Avestimehr,et al. The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching , 2016, IEEE Transactions on Information Theory.
[36] Raymond W. Yeung,et al. A framework for linear information inequalities , 1997, IEEE Trans. Inf. Theory.
[37] Suhas N. Diggavi,et al. Hierarchical Coded Caching , 2016, IEEE Trans. Inf. Theory.
[38] Ravi Tandon,et al. Improved Approximation of Storage-Rate Tradeoff for Caching With Multiple Demands , 2016, IEEE Transactions on Communications.
[39] Chao Tian,et al. Symmetry reduction of information inequalities , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[40] Emil Grosswald,et al. The Theory of Partitions , 1984 .
[41] Mohammad Mohammadi Amiri,et al. Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off , 2016 .
[42] Chao Tian. Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes , 2014, IEEE Journal on Selected Areas in Communications.
[43] 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).