Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
Network Information Theory

Network Information Theory

$94.99 (Z)

textbook
  • Date Published: January 2012
  • availability: In stock
  • format: Hardback
  • isbn: 9781107008731

$94.99 (Z)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • The first complete and unified coverage of both classical and recent results
    • Uses elementary mathematical tools and techniques throughout, making the text open to newcomers to the field
    • Includes a wealth of illustrations, worked examples, bibliographic notes and over 250 end-of-chapter problems
    Read more

    Reviews & endorsements

    "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 practicing 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

    "The illustrations are very helpful. The authors cover an impressively large part of information theory; furthermore, they make it accessible. I do not know of any other book on the subject that contains so many topics of practical relevance to communication engineers. I therefore recommend the book to all students, researchers, and practitioners working in the field of communication."
    Klaus Galensa, Computing Reviews

    "The book is written in a very pedagogical manner, going from simpler models to more sophisticated ones."
    Irina Bocharova, Mathematical 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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: January 2012
    • format: Hardback
    • isbn: 9781107008731
    • length: 709 pages
    • dimensions: 254 x 182 x 36 mm
    • weight: 1.54kg
    • contains: 242 b/w illus. 15 tables 273 exercises
    • availability: In stock
  • 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.

  • Resources for

    Network Information Theory

    Abbas El Gamal, Young-Han Kim

    General Resources

    Welcome to the resources site

    Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.


    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email cflack@cambridge.org

  • Instructors have used or reviewed this title for the following courses

    • Advanced Topics in Information Theory
    • Advanced Topics on Information Theory
    • Algorithmic Aspects of Telecommunication Networks
    • Broadband Digital Communications
    • Network Coding and Applications
    • Network Information Theory
    • Wireless Networking and Cyber-Physical Systems
  • Authors

    Abbas El Gamal, Stanford University
    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. 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 IEEE and the winner of the 2012 Claude E. Shannon Award, the highest honor in the field of information theory.

    Young-Han Kim, University of California, San Diego
    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 IEEE Information Theory Paper Award and the 2008 NSF Faculty Early Career Development (CAREER) Award.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email cflack@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Find content that relates to you

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×