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

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

2005-05-24

arxiv.org/abs/cs/0505061v1

Computer Science

Data Structures and Algorithms

16 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

EAH: A New Encoder based on Adaptive Variable-length Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with EAH: A New Encoder based on Adaptive Variable-length Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and EAH: A New Encoder based on Adaptive Variable-length Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72631