Universal types and simulation of individual sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 312-321

  Seroussi, Gadiel ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; PROBABILITY;

CODE LENGTH; FINITE ORDER; INCREMENTAL PARSING; INDIVIDUAL SEQUENCES; PROBABILITY ASSIGNMENT; SEQUENCE LENGTHS; TYPE CLASS;

PROBABILITY DISTRIBUTIONS;

EID: 33846852454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_35     Document Type: Article

References (10)

1. Csiszár, I., Körner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic, New York (1981)
2. Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Inc., New York (1991)
3. Csiszár, I.: The method of types. IEEE Trans. Inform. Theory IT-44 (1998) 2505-2523
4. Merhav, N., Weinberger, M.J.: On universal simulation of information sources using training data. Technical Report HPL-2002-263, Hewlett-Packard Laboratories (2002) To appear in IEEE Transactions on Information Theory.
5. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory IT-24 (1978) 530-536
6. Rissanen, J.: A universal data compression system. IEEE Trans. Inform. Theory IT-29 (1983) 656-664
7. Seroussi, G.: Universal types and simulation of individual sequences, in preparation (2003)
8. Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, third edn. Volume 2. Addison-Wesley, Reading, MA (1998)
9. Freiling, C., Jungreis, D., Theberge, F., Zeger, K.: Almost all complete binary prefix codes have a self-synchronizing string. IEEE Trans. Inform. Theory IT-49 (2003) 2219-2225
10. Cover, T.M.: Enumerative source encoding. IEEE Transactions on Information Theory IT-19 (1973) 73-77