Title :
On universal types
Author :
Seroussi, Gadiel
Author_Institution :
Hewlett-Packard Labs., Palo Alto, CA, USA
fDate :
27 June-2 July 2004
Abstract :
This work presents universal simulation of individual sequences based on the type class with uniform probability. Further the properties of universal (LZ) type class, including the number of such types, which is super-polynomial in the sequence length n is studied. This paper also discusses parsing tree and empirical entropy rate of random sequences.
Keywords :
entropy; polynomials; random sequences; trees (mathematics); empirical entropy rate; parsing tree; polynomial; random sequence; sequence length; uniform probability; universal simulation; universal type class property; Laboratories; Milling machines; Probability;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365258