Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints
- 1 April 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 146-161
- https://doi.org/10.1007/3-540-36978-3_10
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Network information flow: limits and achievabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Linear codes for network information flowPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Network information flow theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Elements of Information TheoryPublished by Wiley ,2001
- Network information flowIEEE Transactions on Information Theory, 2000
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- A coding theorem for the discrete memoryless broadcast channelIEEE Transactions on Information Theory, 1979
- Interference channelsIEEE Transactions on Information Theory, 1978