Network Information Theory
Autor Abbas El Gamal, Young-Han Kimen Limba Engleză Paperback – 7 mar 2018
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 483.38 lei 6-8 săpt. | |
Cambridge University Press – 7 mar 2018 | 483.38 lei 6-8 săpt. | |
Hardback (1) | 695.24 lei 6-8 săpt. | |
Cambridge University Press – 7 dec 2011 | 695.24 lei 6-8 săpt. |
Preț: 483.38 lei
Preț vechi: 543.12 lei
-11% Nou
Puncte Express: 725
Preț estimativ în valută:
92.51€ • 96.09$ • 76.84£
92.51€ • 96.09$ • 76.84£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781108453240
ISBN-10: 1108453244
Pagini: 713
Ilustrații: 231 b/w illus. 12 tables 273 exercises
Dimensiuni: 170 x 245 x 38 mm
Greutate: 1.12 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:Cambridge, United Kingdom
ISBN-10: 1108453244
Pagini: 713
Ilustrații: 231 b/w illus. 12 tables 273 exercises
Dimensiuni: 170 x 245 x 38 mm
Greutate: 1.12 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:Cambridge, United Kingdom
Cuprins
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.
Recenzii
'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.
'El Gamal and Kim have written a masterpiece. It brings organization and clarity to a large and previously chaotic field. The mathematics is done cleanly and carefully, and the intuition behind the results is brought out with clarity.' Robert G. Gallager, Massachusetts Institute of Technology
'On offer in this text is a superb unified pedagogical treatment including results that heretofore were only available in their original, often arcane, sources. While key regions in network information theory remain terra incognita, future discoveries are bound to owe a debt of gratitude to El Gamal and Kim's comprehensive magnum opus.' Sergio Verdú, Princeton University
'I … recommend the book to all students, researchers, and practitioners.' Klaus Galensa, Computing Reviews
'The presentation is based on basic knowledge of probability and elementary mathematical tools and techniques, making the book accessible to graduate students and for self-study. But the width of covering (this is the first unified treatment of both classical and recent results) makes the book valuable also to researchers and practitioners.' Jaak Henno, Zentralblatt MATH
'El Gamal and Kim have written a masterpiece. It brings organization and clarity to a large and previously chaotic field. The mathematics is done cleanly and carefully, and the intuition behind the results is brought out with clarity.' Robert G. Gallager, Massachusetts Institute of Technology
'On offer in this text is a superb unified pedagogical treatment including results that heretofore were only available in their original, often arcane, sources. While key regions in network information theory remain terra incognita, future discoveries are bound to owe a debt of gratitude to El Gamal and Kim's comprehensive magnum opus.' Sergio Verdú, Princeton University
'I … recommend the book to all students, researchers, and practitioners.' Klaus Galensa, Computing Reviews
'The presentation is based on basic knowledge of probability and elementary mathematical tools and techniques, making the book accessible to graduate students and for self-study. But the width of covering (this is the first unified treatment of both classical and recent results) makes the book valuable also to researchers and practitioners.' Jaak Henno, Zentralblatt MATH
Notă biografică
Descriere
The first complete and unified coverage of both classical and recent results, including numerous worked examples and over 250 exercises.