A Caltech Library Service

Normalized Entropy Vectors, Network Information Theory and Convex Optimization

Hassibi, Babak and Shadbakht, Sormeh (2007) Normalized Entropy Vectors, Network Information Theory and Convex Optimization. In: IEEE Information Theory Workshop for Information Theory for Wireless Networks, Solstrand, Norway, 1-6 July 2007. IEEE , Piscataway, NJ, pp. 1-5. ISBN 1-4244-1200-5.

See Usage Policy.


Use this Persistent URL to link to this item:


We introduce the notion of normalized entropic vectors -- slightly different from the standard definition in the literature in that we normalize entropy by the logarithm of the alphabet size. We argue that this definition is more natural for determining the capacity region of networks and, in particular, that it smooths out the irregularities of the space of non-normalized entropy vectors and renders the closure of the resulting space convex (and compact). Furthermore, the closure of the space remains convex even under constraints imposed by memoryless channels internal to the network. It therefore follows that, for a large class of acyclic memoryless networks, the capacity region for an arbitrary set of sources and destinations can be found by maximization of a linear function over the convex set of channel-constrained normalized entropic vectors and some linear constraints. While this may not necessarily make the problem simpler, it certainly circumvents the "infinite-letter characterization" issue, as well as the nonconvexity of earlier formulations, and exposes the core of the problem. We show that the approach allows one to obtain the classical cutset bounds via a duality argument. Furthermore, the approach readily shows that, for acyclic memoryless wired networks, one need only consider the space of unconstrained normalized entropic vectors, thus separating channel and network coding -- a result very recently recognized in the literature.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© Copyright 2007 IEEE. Reprinted with permission. Posted online: 2007-09-24.
Record Number:CaltechAUTHORS:HASitwitwn07
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:8911
Deposited By: Archive Administrator
Deposited On:26 Sep 2007
Last Modified:08 Nov 2021 20:54

Repository Staff Only: item control page