Network Information Theory
Cambridge University Press, 12/8/2011
EAN 9781107008731, ISBN10: 1107008735
Hardcover, 709 pages, 24.9 x 17.8 x 3.8 cm
Language: English
This comprehensive treatment of network information theory and its applications provides the first unified coverage of both classical and recent results. With an approach that balances the introduction of new models and new coding techniques, readers are guided through Shannon's point-to-point information theory, single-hop networks, multihop networks, and extensions to distributed computing, secrecy, wireless communication, and networking. Elementary mathematical tools and techniques are used throughout, requiring only basic knowledge of probability, whilst unified proofs of coding theorems are based on a few simple lemmas, making the text accessible to newcomers. Key topics covered include successive cancellation and superposition coding, MIMO wireless communication, network coding, and cooperative relaying. Also covered are feedback and interactive communication, capacity approximations and scaling laws, and asynchronous and random access channels. This book is ideal for use in the classroom, for self-study, and as a reference for researchers and engineers in industry and academia.
1. Introduction
Part I. Preliminaries
2. Information measures and typicality
3. Point-to-point information theory
Part II. Single-Hop Networks
4. Multiple access channels
5. Degraded broadcast channels
6. Interference channels
7. Channels with state
8. General broadcast channels
9. Gaussian vector channels
10. Distributed lossless compression
11. Lossy compression with side information
12. Distributed lossy compression
13. Multiple description coding
14. Joint source-channel coding
Part III. Multihop Networks
15. Graphical networks
16. Relay channels
17. Interactive channel coding
18. Discrete memoryless networks
19. Gaussian networks
20. Compression over graphical networks
Part IV. Extensions
21. Communication for computing
22. Information theoretic secrecy
23. Wireless fading channels
24. Networking and information theory
Appendices
A. Convex sets and functions
B. Probability and estimation
C. Cardinality bounding techniques
D. Fourier–Motzkin elimination
E. Convex optimization.
Advance praise: 'El Gamal and Kim have produced the most extensive and inclusive text on all aspects of information theory to date. They have collected and organized the fruits of six decades of research demonstrating how Shannon's original seminal theory has been enlarged to solve a multitude of important problems mostly encountered in multiple link communication networks. The authors stress the significance of these results for timely applications such as multi-hop wireless networks. Beyond its value as a textbook for an advanced course on information theory, the attention given to motivating applications makes it useful for practising communication engineers as well.' Andrew Viterbi, University of Southern California and co-founder of Qualcomm, Inc.