Modelling the EAH Data Compression Algorithm using Graph Theory

Simple item page
dc.creatorTrinca, Dragos
dc.date2005-08-21
dc.date.accessioned2026-07-07T03:23:21Z
dc.date.available2026-07-07T03:23:21Z
dc.descriptionAdaptive 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/cs/0508089
dc.identifierhttp://arxiv.org/abs/cs/0508089
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32909
dc.subjectData Structures and Algorithms
dc.subjectE.4; G.2.2
dc.titleModelling the EAH Data Compression Algorithm using Graph Theory
dc.typetext

Files

Collections

arXiv