Combinatorial optimization
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Information flow decomposition for network coding
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable rate region. We also provide an alternative proof for the set of achievable rate tuples.