Modelling the EAH Data Compression Algorithm using Graph Theory

Translating the EAH Data Compression Algorithm into Automata Theory

Adaptive codes have been introduced in [Dragos Trinca, cs.DS/0505007] as a new class of non-standard variable-length codes. These codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. A new data compression algorithm, called EAH, has been introduced in [Dragos Trinca, cs.DS/0505061], where we have behaviorally shown that for a large class of input data strings, this algorithm substantially outperforms the well-known Lempel-Ziv universal data compression algorithm. In this paper, we translate the EAH encoder into automata …

EAH: A New Encoder based on Adaptive Variable-length Codes

Adaptive variable-length codes associate a variable-length codeword to the symbol being encoded depending on the previous symbols in the input string. This class of codes has been recently presented in [Dragos Trinca, arXiv:cs.DS/0505007] as a new class of non-standard variable-length codes. New algorithms for data compression, based on adaptive variable-length codes of order one and Huffman's algorithm, have been recently presented in [Dragos Trinca, ITCC 2004]. In this paper, we extend the work done so far by the following contributions: first, we propose an improved generalization of these …

2026年算法信息论数据压缩挑战赛

The 2026 Algorithmic Information Theory Data Compression Challenge

提出2026年算法信息论数据压缩挑战赛，通过公共训练和隐藏测试数据集评估117个通用无损压缩器，发现性能强烈依赖优化标准，并验证了概率建模、隐藏测试和外部数据集的重要性。