Optimality and Approximate Optimality of Source-Channel Separation in Networks Conference Paper uri icon


  • We consider the optimality of source-channel separation in networks, and show that such a separation approach is optimal or approximately optimal for a large class of scenarios. More precisely, for lossy coding of memoryless sources in a network, when the sources are mutually independent, and each source is needed only at one destination (or at multiple destinations at the same distortion level), the separation approach is optimal; for the same setting but each source is needed at multiple destinations under a restricted class of distortion measures, the separation approach is approximately optimal, in the sense that the loss from optimum can be upper-bounded. The communication channels in the network are general, including various multiuser channels with finite memory and feedback, the sources and channels can have different bandwidths, and the sources can be present at multiple nodes. 2010 IEEE.

name of conference

  • 2010 IEEE International Symposium on Information Theory

published proceedings

  • 2010 IEEE International Symposium on Information Theory

author list (cited authors)

  • Tian, C., Chen, J., Diggavi, S. N., & Shamai, S.

citation count

  • 21

complete list of authors

  • Tian, Chao||Chen, Jun||Diggavi, Suhas N||Shamai, Shlomo

publication date

  • January 1, 2010 11:11 AM