On the Symmetry Reduction of Information Inequalities
暂无分享,去创建一个
[1] Chao Tian. Symmetry, demand types and outer bounds in caching systems , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[2] Kannan Ramchandran,et al. Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff , 2010, IEEE Transactions on Information Theory.
[3] Chao Tian. Latent capacity region: A case study on symmetric broadcast with common messages , 2009, ISIT.
[4] Zhen Zhang,et al. On Symmetrical Multilevel Diversity Coding , 1999, IEEE Trans. Inf. Theory.
[5] 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).
[6] Larry Masinter,et al. Constructive graph labeling using double cosets , 1974, Discret. Math..
[7] Tie Liu,et al. Symmetrical Multilevel Diversity Coding and Subset Entropy Inequalities , 2014, IEEE Transactions on Information Theory.
[8] Chao Tian,et al. Cyclically symmetric entropy inequalities , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[9] Nicholas A. Loehr,et al. Bijective Combinatorics , 2011 .
[10] Frank Harary,et al. Graph Theory , 2016 .
[11] Chao Tian,et al. Orbit-entropy cones and extremal pairwise orbit-entropy inequalities , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[12] Zhen Zhang,et al. On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.
[13] Raymond W. Yeung,et al. Information Theory and Network Coding , 2008 .
[14] Alexandros G. Dimakis,et al. Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[15] C. L. Liu,et al. Introduction to Combinatorial Mathematics. , 1971 .
[16] Jayant Apte,et al. Exploiting symmetry in computing polyhedral bounds on network coding rate regions , 2015, 2015 International Symposium on Network Coding (NetCod).
[17] Michael A. Harrison,et al. On the Cycle Index of a Product of Permutation Groups , 1968 .
[18] Urs Niesen,et al. Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.
[19] N. Jacobson,et al. Basic Algebra II , 1989 .
[20] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .
[21] N. Jacobson,et al. Basic Algebra I , 1976 .
[22] Anton Betten,et al. Classifying discrete objects with orbiter , 2014, ACCA.
[23] John MacLaren Walsh,et al. Multilevel Diversity Coding Systems: Rate Regions, Codes, Computation, & Forbidden Minors , 2014, IEEE Transactions on Information Theory.
[24] F. Harary,et al. The power group enumeration theorem , 1966 .
[25] Wan-Di Wei,et al. Cycle index of direct product of permutation groups and number of equivalence classes of subsets of Zv , 1993, Discret. Math..
[26] Te Sun Han. Nonnegative Entropy Measures of Multivariate Symmetric Correlations , 1978, Inf. Control..
[27] Chao Tian. Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes , 2014, IEEE Journal on Selected Areas in Communications.
[28] Chao Tian. A Note on the Fundamental Limits of Coded Caching , 2015, ArXiv.