Abstract
The context-tree weighting (CTW) algorithm is a universal source coding algorithm for binary tree sources. This paper presents 3 techniques that modify the CTW algorithm for non-binary, and especially for ASCII-character oriented, tree sources.
Original language | English |
---|---|
Title of host publication | Proceedings of IEEE International Symposium on Information Theory 29 June-4 July 1997 |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 64- |
Number of pages | 1 |
ISBN (Print) | 0-7803-3956-8 |
DOIs | |
Publication status | Published - 1997 |
Event | 1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany Duration: 29 Jun 1997 → 4 Jul 1997 |
Conference
Conference | 1997 IEEE International Symposium on Information Theory, ISIT 1997 |
---|---|
Country/Territory | Germany |
City | Ulm |
Period | 29/06/97 → 4/07/97 |
Other | Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, 29 June - 2 July 1997 |