By Topic

Computation of Universal Objects for Distributions Over Co-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
$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

2 Author(s)
Petersen, H.D. ; Dept. of Math. Sci., Univ. of Copenhagen, Copenhagen, Denmark ; Topsoe, F.

For an ordered set, consider the model of distributions P for which an element that precedes another element is considered the more significant one in the sense that the implication abP(a) ≥ P(b) holds. It will be shown that if the ordered set is a finite co-tree, then the universal predictor for the model or, equivalently, the corresponding universal code, can be determined exactly via an algorithm of low complexity. Natural relations to problems on the computation of capacity and on the determination of information projections are established. More surprisingly, a direct connection to a problem of isotone regression also appears possible.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 12 )