DocumentCode
2054995
Title
On universal types
Author
Seroussi, Gadiel
Author_Institution
Hewlett-Packard Labs., Palo Alto, CA, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
223
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365258
Filename
1365258
Link To Document