DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 2004; 339 pp; hardcover Volume: 66 ISBN10: 0821834673 ISBN13: 9780821834671 List Price: US$109 Member Price: US$87.20 Order Code: DIMACS/66
 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 17 were copublished 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  A. Faridi, K. SayrafianPour, 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 gametheoretic look at the Gaussian multiaccess channel
 X. Liu and R. Srikant  Bounds on the sum timing capacity of singleserver 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 leastfavorable 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 sourcechannel communication in networks
 S. S. Pradhan and K. Ramchandran  Duality in multiuser source and channel coding
Part IV. Coding  G. Caire, S. Shamai, and S. Verdú  Noiseless data compression with lowdensity paritycheck codes
 S. N. Diggavi, N. AlDhahir, 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 informationtheoretic approach to bitstuffing for network protocols
