AMS Bookstore LOGO amslogo
Return to List  Item: 1 of 1   
Advances in Network Information Theory
Edited by: Piyush Gupta, Gerhard Kramer, and Adriaan J. van Wijngaarden, Bell Laboratories, Lucent Technologies, Murray Hill, NJ
A co-publication of the AMS and DIMACS.

DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
2004; 339 pp; hardcover
Volume: 66
ISBN-10: 0-8218-3467-3
ISBN-13: 978-0-8218-3467-1
List Price: US$115
Member Price: US$92
Order Code: DIMACS/66
[Add Item]

Request Permissions

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).


Graduate students and research mathematicians interested in information theory.

Table of Contents

Part I. Information theory for sources
  • A. Faridi, K. Sayrafian-Pour, M. Alasti, and A. Ephremides -- Source coding and parallel routing
  • S. A. Savari -- Compressing a representation of events in a concurrent system
  • P. Viswanath -- Sum rate of a class of multiterminal Gaussian source coding problems
  • F. M. J. Willems and T. Kalker -- Coding theorems for reversible embedding
Part II. Information theory for channels
  • A. S. Cohen and R. Zamir -- Unbounded loss in writing on dirty paper is possible
  • R. J. La and V. Anatharam -- A game-theoretic look at the Gaussian multiaccess channel
  • X. Liu and R. Srikant -- Bounds on the sum timing capacity of single-server queues with multiple input and output terminals
  • S. Raj, E. Telatar, and D. Tse -- Job scheduling and multiple access
  • D. Tuninetti and S. Shamai (Shitz) -- Fading Gaussian broadcast channels with state information at the receivers
  • L.-L. Xie and P. R. Kumar -- Wireless network information theory
  • W. Yu -- The structure of least-favorable noise in Gaussian vector broadcast channels
Part III. Information theory for sources and channels
  • J. Barros and S. D. Servetto -- Coding theorems for the sensor reachback problem with partially cooperating nodes
  • M. Effros, M. Médard, T. Ho, S. Ray, D. Karger, R. Koetter, and B. Hassibi -- Linear network codes: A unified framework for source, channel, and network coding
  • M. Gastpar -- On source-channel communication in networks
  • S. S. Pradhan and K. Ramchandran -- Duality in multi-user source and channel coding
Part IV. Coding
  • G. Caire, S. Shamai, and S. Verdú -- Noiseless data compression with low-density parity-check codes
  • S. N. Diggavi, N. Al-Dhahir, and A. R. Calderbank -- Diversity embedding in multiple antenna communications
  • E. Erkip, A. Sendonaris, A. Stefanov, and B. Aazhang -- Cooperative communication in wireless systems
  • E. Soljanin, R. Liu, and P. Spasojevic -- Hybrid ARQ with random transmission assignments
  • J. K. Wolf -- An information-theoretic approach to bit-stuffing for network protocols
Powered by MathJax
Return to List  Item: 1 of 1   

  AMS Home | Comments:
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia