An Approximation Approach to Network Information Theory

A. Salman Avestimehr,Suhas N. Diggavi,Chao Tian,David N. C. Tse

An Approximation Approach to Network Information Theory
Format
Paperback
Publisher
now publishers Inc
Country
United States
Published
4 September 2015
Pages
200
ISBN
9781680830262

An Approximation Approach to Network Information Theory

A. Salman Avestimehr,Suhas N. Diggavi,Chao Tian,David N. C. Tse

The interaction between communication entities, which is unique in the network setting, have been at the root of many difficult challenges in communications and information theory.

This monograph advocates a sequential approach to make progress on the network communication problem. In order to do this, the channel (and source) model to capture the essence of the network communication problem are simplified and connected to the original problem. This leads to the concept of approximate characterizations of the channel capacity region and source coding rate regions. Approximate solutions to information theory problems are not new. However, they are by and far isolated results each with its own proof technique. This monograph describes a breakthrough systematic approach with two levels of approximation that can be applied to many problems. It concludes by demonstrating its application to four central problems in network information theory: (1) Relay networks, (2) Interference channels, (3) Multiple descriptions problem, and (4) Joint source-channel coding over networks.

This monograph is intended for researchers and graduate students working at the forefront of research into network and communications problems.

This item is not currently in-stock. It can be ordered online and is expected to ship in approx 2 weeks

Our stock data is updated periodically, and availability may change throughout the day for in-demand items. Please call the relevant shop for the most current stock information. Prices are subject to change without notice.

Sign in or become a Readings Member to add this title to a wishlist.