Conference proceeding
Symmetry in Network Coding
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), pp.376-380
01 Jan 2015
Abstract
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.
Metrics
8 Record Views
Details
- Title
- Symmetry in Network Coding
- Creators
- Jayant Apte - Drexel Univ, Dept ECE, Philadelphia, PA 19104 USAJohn MacLaren Walsh - Drexel UniversityIEEE
- Publication Details
- 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), pp.376-380
- Conference
- 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
- Series
- IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Number of pages
- 5
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Electrical and Computer Engineering
- Identifiers
- 991019170473604721
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Web of Science research areas
- Computer Science, Theory & Methods
- Engineering, Electrical & Electronic