|
ABSTRACT
Adaptive codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been introduced in [6] as a new class of non-standard variable-length codes. New algorithms for data compression, based on adaptive codes of order one and Huffman codes, have been presented in [7], where we have behaviorally shown that for a large class of input data strings, these algorithms substantially outperform the Lempel-Ziv universal data compression algorithm [12]. EAH has been introduced in [8], as an improved generalization of these algorithms. In this paper, we introduce Meta-EAH, an adaptive version of the EAH algorithm. Some comparisons between Meta-EAH and the Lempel-Ziv universal data compression algorithm are reported.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
| |
6
|
D. Trincă. Adaptive Codes: A New Class of Non-standard Variable-length Codes. (submitted to Romanian Journal of Information Science and Technology)
|
| |
7
|
|
| |
8
|
D. Trincă. EAH: An Encoder based on Adaptive Codes and Huffman Codes. (submitted to ISIT 2004, Chicago, Illinois, USA)
|
| |
9
|
D. Trincă. Towards Combinatorial Translations of the EAH Data Compression Algorithm. (submitted to ICALP 2004, Turku, Finland)
|
| |
10
|
F. L. Tiplea, E. Mäkinen, C. Enea. SE-Systems, Timing Mechanisms and Time-Varying Codes. International Journal of Computer Mathematics 79(10), 2002, 1083--1091.
|
| |
11
|
|
| |
12
|
J. Ziv, A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, vol. IT-24, 1978, 530--536.
|
|