Network Information Theory
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer networking and communications > Network Information Theory
Network Information Theory

Network Information Theory


     0     
5
4
3
2
1



International Edition


X
About the Book

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.

Table of Contents:
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.

About the Author :
Abbas El Gamal is the Hitachi America Chaired Professor in the School of Engineering and the Chair of the Department of Electrical Engineering at Stanford University, California. In the field of network information theory, he is best known for his seminal contributions to the relay, broadcast, and interference channels; multiple description coding; coding for noisy networks; and energy-efficient packet scheduling and throughput-delay tradeoffs in wireless networks. He is a Fellow of the Institute of Electrical and Electronics Engineers and the winner of the 2012 Claude E. Shannon Award, the highest honor in the field of information theory. Young-Han Kim is an Associate Professor in the Department of Electrical and Computer Engineering at the University of California, San Diego. His research focuses on information theory and statistical signal processing. He is a recipient of the 2012 Institute of Electrical and Electronics Engineers Information Theory Paper Award and the 2008 National Science Foundation Faculty Early Career Development (CAREER) Award.

Review :
'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


Best Sellers


Product Details
  • ISBN-13: 9781107008731
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press
  • Height: 254 mm
  • No of Pages: 714
  • Returnable: N
  • Spine Width: 36 mm
  • Width: 182 mm
  • ISBN-10: 1107008735
  • Publisher Date: 08 Dec 2011
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Returnable: N
  • Weight: 1540 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Network Information Theory
Cambridge University Press -
Network Information Theory
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Network Information Theory

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!