Universal coding for distributions over co-trees

  • Authors:

  • Henrik D. Petersen;Flemming Topsøe

  • Affiliations:

  • Department of Mathematical Sciences, University of Copenhagen, Copenhagen, Denmark;Department of Mathematical Sciences, University of Copenhagen, Copenhagen, Denmark

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

For an arbitrary ordered set, we consider the model of all distributions P for which an element which precedes another element is considered the more significant one in the sense that the implication a ≤ b ⇒ P(a) ≥ P(b) holds. It will be shown that if the ordered set is a finite co-tree, then the universal predictor for the indicated model or, equivalently, the corresponding universal code, can be determined exactly via an algorithm of reasonably low complexity.