EAH：一种基于自适应变长码的新型编码器
EAH: A New Encoder based on Adaptive Variable-length Codes
摘要：
自适应变长码根据输入字符串中先前的符号将变长码字与正在编码的符号相关联。这类码最近在[Dragos Trinca，arXiv：cs.DS/0505007]中作为一类新的非标准变长码提出。最近在[Dragos Trinca，ITCC 2004]中提出了基于一阶自适应变长码和Huffman算法的数据压缩新算法。在本文中，我们扩展到目前为止所做的工作，以下贡献：首先，我们提出了一个改进的泛化这些算法，称为EAHn。其次，我们计算EAHn的熵界，使用著名的霍夫曼算法的界限。第三，我们讨论了实施细节，并给出了一些著名的语料库上获得的实验结果的报告。最后，我们描述了一个并行版本的EAHn使用PRAM模型的计算。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
