Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
暂无分享,去创建一个
[1] K. Brown,et al. Graduate Texts in Mathematics , 1982 .
[2] Zhen Zhang,et al. A non-Shannon-type conditional inequality of information quantities , 1997, IEEE Trans. Inf. Theory.
[3] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[4] Søren Riis,et al. Information flows, graphs and their guessing numbers , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.
[5] Søren Riis. Graph Entropy, Network Coding and Guessing games , 2007, ArXiv.
[6] Muriel Médard,et al. A Systematic Approach to Network Coding Problems using Conflict Graphs , 2006 .
[7] Randall Dougherty,et al. Linearity and solvability in multicast networks , 2004, IEEE Transactions on Information Theory.
[8] R. Graham,et al. Handbook of Combinatorics , 1995 .
[9] Rudolf Ahlswede,et al. General Theory of Information Transfer and Combinatorics , 2006, GTIT-C.
[10] Vahid Tarokh,et al. Scheduling Algorithms for Providing Flexible , Rate-Based , Quality of Service Guarantees for Packet-Switching in Banyan Networks , 2004 .
[11] Gábor Simonyi,et al. Graph entropy: A survey , 1993, Combinatorial Optimization.
[12] Søren Riis. Utilising public information in Network Coding , 2005 .
[13] Randall Dougherty,et al. Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.
[14] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[15] Randall Dougherty,et al. Unachievability of network coding capacity , 2006, IEEE Transactions on Information Theory.
[16] Jochen Harant,et al. On the independence number of a graph in terms of order and size , 2001, Discret. Math..
[17] Randall Dougherty,et al. Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.
[18] R. Koetter,et al. Scheduling for Network Coded Multicast: A Conflict Graph Formulation , 2008, 2008 IEEE Globecom Workshops.
[19] Tracey Ho,et al. A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.
[20] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[21] Randall Dougherty,et al. Networks, Matroids, and Non-Shannon Information Inequalities , 2007, IEEE Transactions on Information Theory.
[22] Muriel Médard,et al. An algebraic approach to network coding , 2003, TNET.
[23] Alexander Sprintson,et al. On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.
[24] Randall Dougherty,et al. Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks , 2006, IEEE Transactions on Information Theory.
[25] Søren Riis,et al. Reversible and Irreversible Information Networks , 2007, IEEE Transactions on Information Theory.
[26] N. J. A. Sloane,et al. A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.
[27] Michael O. Albertson,et al. Homomorphisms of 3-chromatic graphs , 1985, Discret. Math..
[28] L. Babai. Automorphism groups, isomorphism, reconstruction , 1996 .
[29] T. Ho,et al. On Linear Network Coding , 2010 .
[30] Alexander Vardy,et al. Upper bounds for constant-weight codes , 2000, IEEE Trans. Inf. Theory.
[31] Zhen Zhang,et al. On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.
[32] Selmer M. Johnson. A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.
[33] Peter J. Cameron,et al. On the guessing number of shift graphs , 2009, J. Discrete Algorithms.
[34] Robert Brignall. Wreath Products of Permutation Classes , 2007, Electron. J. Comb..
[35] ZegerKenneth,et al. Unachievability of network coding capacity , 2006 .
[36] Søren Riis. Information flows, graphs and their guessing , 2006 .
[37] Rudolf Ahlswede,et al. Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding" , 2006, GTIT-C.