Abstract
According to the max-flow min-cut theorem a source s can transmit information to a sink t in a graph (V,E) at a rate that does not exceed the capacity of the minimal cut that separates the source and the sink. Recently, it has been shown that if the intermediate nodes in the network are allowed to code the information that they receive, then the source s can multicast common information to several sinks at a rate that does not exceed the min-cut between the source and any of the individual sinks. In this paper we find the achievable rate region when there are two receiver nodes ti and t2, but we allow both common information at rate Ro and private information rates to ti and t2 at rates R1, R2, respectively.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Ahlswede, N. Cai, S.-Y.R. Li, and R.W. Yeung, “Network information flow,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204–1216, July 2000.
R. Koetter and M. Medard, “An algebraic approach to network coding,” Proceedings of INFOCOM, 2002.
T.M. Cover, “Comments on broadcast channels,” IEEE Transactions on Information Theory,vol. 44, pp. 2524–2530, 1998.
K. Marton, “A coding theorem for the discrete memoryless broadcast channel,” IEEE Transactions on Information Theory, vol. 25, pp. 306–311, 1979.
T. M. Cover, “An achievable rate region for the broadcast channel,” IEEE Transactions on Information Theory, vol. 21, pp. 399–404, 1975.
R. Yeung, A First Course in Information Theory, Kluwer Academic/Plenum Publishers, March 2002.
P. Sanders, S. Egner, and L. Tolhuizen, “Polynomial time algorithms for network information flow,” 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Basel AG
About this paper
Cite this paper
Erez, E., Feder, M. (2004). The Capacity Region of Broadcast Networks with Two Receivers. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7865-4_7
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9602-3
Online ISBN: 978-3-0348-7865-4
eBook Packages: Springer Book Archive