By Topic

Entropic aspects of random fields on trees

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
$33 $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

2 Author(s)
T. Berger ; Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA ; Z. Ye

The existence of the entropy rate of shift-invariant random fields on binary trees is proven. Alternative representations of and bounds for the entropy rate and surface entropy rate are obtained in terms of conditional entropy. Particular emphasis is placed on Markov chain fields on trees; explicit results are obtained, some of which extend to a more complicated class of tree models

Published in:

IEEE Transactions on Information Theory  (Volume:36 ,  Issue: 5 )