EAH: A New Encoder based on Adaptive Variable-length Codes
| dc.creator | Trinca, Dragos | |
| dc.date | 2005-05-24 | |
| dc.date.accessioned | 2026-07-07T03:23:01Z | |
| dc.date.available | 2026-07-07T03:23:01Z | |
| dc.description | 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 algorithms, called EAHn. Second, we compute the entropy bounds for EAHn, using the well-known bounds for Huffman's algorithm. Third, we discuss implementation details and give reports of experimental results obtained on some well-known corpora. Finally, we describe a parallel version of EAHn using the PRAM model of computation. | |
| dc.description | 16 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0505061 | |
| dc.identifier | http://arxiv.org/abs/cs/0505061 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32783 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | E.4; F.4.3 | |
| dc.title | EAH: A New Encoder based on Adaptive Variable-length Codes | |
| dc.type | text |