A separation theorem for single-source network coding

  • Authors:
  • L. Song;R. W. Yeung;N. Cai

  • Affiliations:
  • Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Oakville, CT, USA;-;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.96

Visualization

Abstract

In this paper, we consider a point-to-point communication network of discrete memoryless channels. In the network, there are a source node and possibly more than one sink node. Information is generated at the source node and is multicast to each sink node. We allow a node to encode its received information before loading it onto an outgoing channel, where the channels are independent of each other. We also allow the nodes to pass along messages asynchronously. In this paper, we characterize the admissibility of single-source multi-sink communication networks. Our result can be regarded as a network generalization of Shannon's result that feedback does not increase the capacity of a discrete memoryless channels (DMCs), and it implies a separation theorem for network coding and channel coding in such a communication network.