Universal source coding theory based on grammar transforms

Proceedings of the 1999 IEEE Information Theory and Communications Workshop

Volumn , Issue , 1999, Pages 75-77

  Yang, En Hui ^a   Kieffer, John C ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING; CONTEXT FREE GRAMMARS; FORMAL LANGUAGES; INFORMATION THEORY;

ARITHMETIC CODING; DATA SEQUENCES; ERGODIC SOURCES; GRAMMAR-BASED CODES; LOSSLESS; LOSSLESS SOURCE CODING; SOURCE CODES; UNIVERSAL SOURCE CODING;

PROGRAMMING THEORY;

EID: 0344007601     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITCOM.1999.781414     Document Type: Conference Paper

References (4)

1. J. C. Kieffer and E.-H. Yang, "Grammar based codes: A new class of universal lossless source codes," submitted to IEEE Trans. Inform. Theory for publication.
2. J. C. Kieffer, E.-H. Yang, G. Nelson, and P. Cosman, "Universal Lossless Compression via Multilevel Pattern Matching," submitted to IEEE Trans. Inform. Theory for publication.
3. E.-H. Yang and Y. Jia, "Efficient universal compression of integer sequences by using multilevel arithmetic coding," To appear in Proc. of the 1999 Canadian Workshop on Inform. Theory, Kingston, Ontario.
4. E.-H. Yang and J. C. Kieffer, "Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform," submitted to IEEE Trans. Inform. Theory for publication, 1998.