By Topic

On sources and networks: Can computational tools derive information theoretic limits?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Effros, M. ; California Inst. of Technol., Pasadena, CA, USA

A source-network coding problem is defined by a set of communication devices (nodes), a collection of error-free, capacitated channels (links) through which they communicate, a collection of random processes (sources) available at some nodes in the network, and a set of requirements (demands) to reconstruct those sources. The limits of such a system's performance are described by a set of achievable distortion vectors; each vector in the relative interior of this set captures the accuracies with which a single code reconstructs the demands at all receivers. The goal of this work is to build computational tools to derive provable inner and outer bounds on the set of achievable distortions for any source-network coding problem.

Published in:

Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on

Date of Conference:

28-30 Sept. 2011