Computer Science – Data Structures and Algorithms
Scientific paper
2005-08-21
Computer Science
Data Structures and Algorithms
10 pages
Scientific paper
Adaptive codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been introduced in [Dragos Trinca, cs.DS/0505007] as a new class of non-standard variable-length codes. New algorithms for data compression, based on adaptive codes of order one, have been presented in [Dragos Trinca, ITCC-2004], where we have behaviorally shown that for a large class of input data strings, these algorithms substantially outperform the Lempel-Ziv universal data compression algorithm. EAH has been introduced in [Dragos Trinca, cs.DS/0505061], as an improved generalization of these algorithms. In this paper, we present a translation of the EAH algorithm into the graph theory.
No associations
LandOfFree
Modelling the EAH Data Compression Algorithm using Graph 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 Modelling the EAH Data Compression Algorithm using Graph Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modelling the EAH Data Compression Algorithm using Graph Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-33486