Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Advances in Network Information Theory
 
Edited by: Piyush Gupta Bell Laboratories, Lucent Technologies, Murray Hill, NJ
Gerhard Kramer Bell Laboratories, Lucent Technologies, Murray Hill, NJ
Adriaan J. van Wijngaarden Bell Laboratories, Lucent Technologies, Murray Hill, NJ
A co-publication of the AMS and DIMACS
Advances in Network Information Theory
Hardcover ISBN:  978-0-8218-3467-1
Product Code:  DIMACS/66
List Price: $129.00
MAA Member Price: $116.10
AMS Member Price: $103.20
eBook ISBN:  978-1-4704-4023-7
Product Code:  DIMACS/66.E
List Price: $121.00
MAA Member Price: $108.90
AMS Member Price: $96.80
Hardcover ISBN:  978-0-8218-3467-1
eBook: ISBN:  978-1-4704-4023-7
Product Code:  DIMACS/66.B
List Price: $250.00 $189.50
MAA Member Price: $225.00 $170.55
AMS Member Price: $200.00 $151.60
Advances in Network Information Theory
Click above image for expanded view
Advances in Network Information Theory
Edited by: Piyush Gupta Bell Laboratories, Lucent Technologies, Murray Hill, NJ
Gerhard Kramer Bell Laboratories, Lucent Technologies, Murray Hill, NJ
Adriaan J. van Wijngaarden Bell Laboratories, Lucent Technologies, Murray Hill, NJ
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-3467-1
Product Code:  DIMACS/66
List Price: $129.00
MAA Member Price: $116.10
AMS Member Price: $103.20
eBook ISBN:  978-1-4704-4023-7
Product Code:  DIMACS/66.E
List Price: $121.00
MAA Member Price: $108.90
AMS Member Price: $96.80
Hardcover ISBN:  978-0-8218-3467-1
eBook ISBN:  978-1-4704-4023-7
Product Code:  DIMACS/66.B
List Price: $250.00 $189.50
MAA Member Price: $225.00 $170.55
AMS Member Price: $200.00 $151.60
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 662004; 339 pp
    MSC: Primary 94;

    This book is a collection of articles written by leading researchers in information theory stemming from the DIMACS Workshop on Network Information held at Rutgers University (Piscataway, NJ). The articles focus on problems concerning efficient and reliable communication in multi-terminal settings. Information theory has recently attracted renewed attention because of key developments spawning challenging research problems.

    The material is divided into four parts: “Information Theory for Sources”, which concentrates on network source coding problems; “Information Theory for Channels”, where channels, rather than sources, are central to the problem; “Information Theory for Sources and Channels”, which addresses both source and channel coding; and “Coding”, which deals with more practical issues. Mathematicians using applications such as wireless cellular and LAN data services, ad hoc networks and sensor networks will benefit from the developments outlined in these sections. The book is suitable for graduate students and research mathematicians interested in communications and network information theory.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

    Readership

    Graduate students and research mathematicians interested in information theory.

  • Table of Contents
     
     
    • Part I. Information theory for sources
    • Source coding and parallel routing
    • Compressing a representation of events in a concurrent system
    • Sum rate of a class of multiterminal Gaussian source coding problems
    • Coding theorems for reversible embedding
    • Part II. Information theory for channels
    • Unbounded loss in writing on dirty paper is possible
    • A game-theoretic look at the Gaussian multiaccess channel
    • Bounds on the sum timing capacity of single-server queues with multiple input and output terminals
    • Job scheduling and multiple access
    • Fading Gaussian broadcast channels with state information at the receivers
    • Wireless network information theory
    • The structure of least-favorable noise in Gaussian vector broadcast channels
    • Part III. Information theory for sources and channels
    • Coding theorems for the sensor reachback problem with partially cooperating nodes
    • Linear network codes: A unified framework for source, channel, and network coding
    • On source-channel communication in networks
    • Duality in multi-user source and channel coding
    • Part IV. Coding
    • Noiseless data compression with low-density parity-check codes
    • Diversity embedding in multiple antenna communications
    • Cooperative communication in wireless systems
    • Hybrid ARQ with random transmission assignments
    • An information-theoretic approach to bit-stuffing for network protocols
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 662004; 339 pp
MSC: Primary 94;

This book is a collection of articles written by leading researchers in information theory stemming from the DIMACS Workshop on Network Information held at Rutgers University (Piscataway, NJ). The articles focus on problems concerning efficient and reliable communication in multi-terminal settings. Information theory has recently attracted renewed attention because of key developments spawning challenging research problems.

The material is divided into four parts: “Information Theory for Sources”, which concentrates on network source coding problems; “Information Theory for Channels”, where channels, rather than sources, are central to the problem; “Information Theory for Sources and Channels”, which addresses both source and channel coding; and “Coding”, which deals with more practical issues. Mathematicians using applications such as wireless cellular and LAN data services, ad hoc networks and sensor networks will benefit from the developments outlined in these sections. The book is suitable for graduate students and research mathematicians interested in communications and network information theory.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

Readership

Graduate students and research mathematicians interested in information theory.

  • Part I. Information theory for sources
  • Source coding and parallel routing
  • Compressing a representation of events in a concurrent system
  • Sum rate of a class of multiterminal Gaussian source coding problems
  • Coding theorems for reversible embedding
  • Part II. Information theory for channels
  • Unbounded loss in writing on dirty paper is possible
  • A game-theoretic look at the Gaussian multiaccess channel
  • Bounds on the sum timing capacity of single-server queues with multiple input and output terminals
  • Job scheduling and multiple access
  • Fading Gaussian broadcast channels with state information at the receivers
  • Wireless network information theory
  • The structure of least-favorable noise in Gaussian vector broadcast channels
  • Part III. Information theory for sources and channels
  • Coding theorems for the sensor reachback problem with partially cooperating nodes
  • Linear network codes: A unified framework for source, channel, and network coding
  • On source-channel communication in networks
  • Duality in multi-user source and channel coding
  • Part IV. Coding
  • Noiseless data compression with low-density parity-check codes
  • Diversity embedding in multiple antenna communications
  • Cooperative communication in wireless systems
  • Hybrid ARQ with random transmission assignments
  • An information-theoretic approach to bit-stuffing for network protocols
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.