Translating the EAH Data Compression Algorithm into Automata Theory

Details Translating the EAH Data Compression Algorithm into Automata Theory Translating the EAH Data Compression Algorithm into Automata Theory

2005-08-21

arxiv.org/abs/cs/0508090v1

Computer Science

Data Structures and Algorithms

9 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Translating the EAH Data Compression Algorithm into Automata Theory 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 Translating the EAH Data Compression Algorithm into Automata Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Translating the EAH Data Compression Algorithm into Automata Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33489