Hardcover ISBN:  9780821834671 
Product Code:  DIMACS/66 
List Price:  $129.00 
MAA Member Price:  $116.10 
AMS Member Price:  $103.20 
eBook ISBN:  9781470440237 
Product Code:  DIMACS/66.E 
List Price:  $121.00 
MAA Member Price:  $108.90 
AMS Member Price:  $96.80 
Hardcover ISBN:  9780821834671 
eBook: ISBN:  9781470440237 
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 
Hardcover ISBN:  9780821834671 
Product Code:  DIMACS/66 
List Price:  $129.00 
MAA Member Price:  $116.10 
AMS Member Price:  $103.20 
eBook ISBN:  9781470440237 
Product Code:  DIMACS/66.E 
List Price:  $121.00 
MAA Member Price:  $108.90 
AMS Member Price:  $96.80 
Hardcover ISBN:  9780821834671 
eBook ISBN:  9781470440237 
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 DetailsDIMACS  Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 66; 2004; 339 ppMSC: 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 multiterminal 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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
ReadershipGraduate 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 gametheoretic look at the Gaussian multiaccess channel

Bounds on the sum timing capacity of singleserver 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 leastfavorable 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 sourcechannel communication in networks

Duality in multiuser source and channel coding

Part IV. Coding

Noiseless data compression with lowdensity paritycheck codes

Diversity embedding in multiple antenna communications

Cooperative communication in wireless systems

Hybrid ARQ with random transmission assignments

An informationtheoretic approach to bitstuffing for network protocols


RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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 multiterminal 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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
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 gametheoretic look at the Gaussian multiaccess channel

Bounds on the sum timing capacity of singleserver 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 leastfavorable 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 sourcechannel communication in networks

Duality in multiuser source and channel coding

Part IV. Coding

Noiseless data compression with lowdensity paritycheck codes

Diversity embedding in multiple antenna communications

Cooperative communication in wireless systems

Hybrid ARQ with random transmission assignments

An informationtheoretic approach to bitstuffing for network protocols