Date Added: Jul 2011
The authors 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. They show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable rate region. They also provide an alternative proof for the set of achievable rate tuples. Consider a group of users in a network represented as an undirected graph that want to exchange information, i.e., each user has information that needs to be received by all other users.