Translating the EAH Data Compression Algorithm into Automata Theory
| dc.creator | Trinca, Dragos | |
| dc.date | 2005-08-21 | |
| dc.date.accessioned | 2026-07-07T03:23:21Z | |
| dc.date.available | 2026-07-07T03:23:21Z | |
| dc.description | 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 theory. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0508090 | |
| dc.identifier | http://arxiv.org/abs/cs/0508090 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32910 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Translating the EAH Data Compression Algorithm into Automata Theory | |
| dc.type | text |