STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Network coding
Edge-Cut Bounds on Network Coding Rates
Journal of Network and Systems Management
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
An outer bound for multisource multisink network coding with minimum cost consideration
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Zero-error network coding for acyclic networks
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Insufficiency of linear coding in network information flow
IEEE Transactions on Information Theory
Information flow decomposition for network coding
IEEE Transactions on Information Theory
A separation theorem for single-source network coding
IEEE Transactions on Information Theory
Network Coding Capacity With a Constrained Number of Coding Nodes
IEEE Transactions on Information Theory
Cross-layer optimization for wireless multihop networks with pairwise intersession network coding
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Cross-layer optimization of wireless multihop networks with one-hop two-way network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Star-Structure Network Coding for Multiple Unicast Sessions in Wireless Mesh Networks
Wireless Personal Communications: An International Journal
On the Multiple-Unicast Capacity of 3-Source, 3-Terminal Directed Acyclic Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.84 |
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow theorem. For the case of more than one coexisting sessions, network coding also demonstrates throughput improvement over noncoded solutions. This paper proposes pairwise intersession network coding, which allows for arbitrary directed networks but restricts the coding operations to being between two symbols (for acyclic networks) or between two strings of symbols (for cyclic networks). A graph-theoretic characterization of pairwise intersession network coding is proven based on paths with controlled edge-overlap. This new characterization generalizes the edge-disjoint path characterization of noncoded network communication and includes the well-studied butterfly graph as a special case. Based on this new characterization, various aspects of pairwise intersession network coding are studied, including the sufficiency of linear codes, the complexity of identifying coding opportunities, its topological analysis, and bandwidth- and coding-efficiency.