Slepian-Wolf-Cover Theorem for Networks of Channels

@article{Han1980SlepianWolfCoverTF,
  title={Slepian-Wolf-Cover Theorem for Networks of Channels},
  author={Te Sun Han},
  journal={Information and Control},
  year={1980},
  volume={47},
  pages={67-83}
}
Given a general network of discrete memoryless independent channels with multiple supply nodes and a single sink node, a Slepian-Wolf-Cover type of problem of transmitting multiple correlated informations through the network from the supply nodes to the sink node is considered from the source-channel matching point of view. By introducing the concept of achievable network, we give the necessary and sufficient condition for a network to be achievable, while making full use of the polymatroidal… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 89 citations. REVIEW CITATIONS
56 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 56 extracted citations

89 Citations

01020'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

1979a), Source coding with cross observation at the encoders

  • HAN T.S. York
  • 1979

Matroid Theory," Academic Press, London/New York

  • D.J.A. WELSh
  • Printed in Belgium
  • 1976

On the continuous communication networks including feedback branches, RAAG Research Notes

  • S. AMARI
  • Third Series,
  • 1963

Similar Papers

Loading similar papers…