By Topic

OPEC or a basic problem in source networks

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)

The problem of determining the achievable rate region for an arbitrary source network with one "helper" is still unsolved. Csiszár and the author have shown that it reduces to the one-parameter entropy characterization problem (OPEC), treated in their monograph on information theory. For a discrete memoryless multiple source, solving the OPEC problem means finding a computable characterization of the per-letter conditional entropies of the first n outputs of each of the component sources given an arbitrary function of the first n outputs of the first component source. For sources with three components, the OPEC problem has been solved by Csiszár, Körner, and Marton. However, their result has a very asymmetric form and has not been generalized. This paper gives a substantially simpler proof of the same result in a new symmetric form. Moreover, for sources with more than three components, a new increased region of simultaneously attainable conditional entropies is derived.

Published in:

Information Theory, IEEE Transactions on  (Volume:30 ,  Issue: 1 )