Symmetry in network coding

We establish connections between graph theoretic symmetry, symmetries of network codes, and symmetries of rate regions for k-unicast network coding and multi-source network coding. We identify a group we call the network symmetry group as the common thread between these notions of symmetry and characterize it as a subgroup of the automorphism group of a directed cyclic graph appropriately constructed from the underlying network's directed acyclic graph. Such a characterization allows one to obtain the network symmetry group using algorithms for computing automorphism groups of graphs. We discuss connections to generalizations of Chen and Yeung's partition symmetrical entropy functions and how knowledge of the network symmetry group can be utilized to reduce the complexity of computing the LP outer bounds on network coding capacity as well as the complexity of polyhedral projection for computing rate regions.

[1]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

[2]  David Joyner,et al.  SAGE: system for algebra and geometry experimentation , 2005, SIGS.

[3]  Mathieu Dutour Sikiric,et al.  Polyhedral representation conversion up to symmetries , 2007, ArXiv.

[4]  Raymond W. Yeung,et al.  Partition-Symmetrical Entropy Functions , 2014, IEEE Transactions on Information Theory.

[5]  G. Ziegler.  Lectures on Polytopes , 1994 .

[6]  R. Bodi,et al.  SYMMETRIES IN LINEAR AND INTEGER PROGRAMS , 2009, 0908.3329.

[7]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[8]  Michael Joswig,et al.  Algorithms for highly symmetric linear and integer programs , 2010, Mathematical Programming.

[9]  Steven P. Weber,et al.  A computational approach for determining rate regions and codes using entropic vector bounds , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  S. Gottwald,et al.  Fuzzy set theory and its applications. Second edition , 1992 .

[11]  Maximilien Gadouleau,et al.  Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications , 2011, IEEE Transactions on Information Theory.

[12]  John MacLaren Walsh,et al.  Multilevel Diversity Coding Systems: Rate Regions, Codes, Computation, & Forbidden Minors , 2014, IEEE Transactions on Information Theory.

[13]  Volker Kaibel,et al.  On the Complexity of Polytope Isomorphism Problems , 2003, Graphs Comb..

[14]  Brendan D. McKay,et al.  Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.

[15]  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.

[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]  Steven P. Weber,et al.  A new computational approach for determining rate regions and optimal codes for coded networks , 2013, 2013 International Symposium on Network Coding (NetCod).

[18]  Jayant Apte,et al.  Algorithms for computing network coding rate regions via single element extensions of matroids , 2014, 2014 IEEE International Symposium on Information Theory.

[19]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[20]  Zhen Zhang,et al.  An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink Network Coding , 2012, IEEE Transactions on Information Theory.