Slepian-Wolf-Cover theorem for networks of channels
- 31 October 1980
- journal article
- Published by Elsevier in Information and Control
- Vol. 47 (1) , 67-83
- https://doi.org/10.1016/s0019-9958(80)90284-3
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A unified achievable rate region for a general class of multiterminal source coding systemsIEEE Transactions on Information Theory, 1980
- Source coding with cross observations at the encoders (Corresp.)IEEE Transactions on Information Theory, 1979
- The capacity region of general multiple-access channel with certain correlated sourcesInformation and Control, 1979
- ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMSJournal of the Operations Research Society of Japan, 1978
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)IEEE Transactions on Information Theory, 1975
- Optimal flows in networks with multiple sources and sinksMathematical Programming, 1974
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973
- Networks of Gaussian channels with applications to feedback systemsIEEE Transactions on Information Theory, 1967
- A note on the maximum flow through a networkIEEE Transactions on Information Theory, 1956