The data compression book (2nd ed.)
The data compression book (2nd ed.)
Data compression: the complete reference
Data compression: the complete reference
Handbook of Formal Languages
Handbook of Coding Theory
Theory of Codes
Characterization results for time-varying codes
Fundamenta Informaticae
Towards New Algorithms for Data Compression Using Adaptive Codes
ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
| Hi-index | 0.01 |
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.