most citedAdaptive Codes: A New Class of Non-standard Variable-length Codes

3 citations · 4 across the 8 of their papers we have counts for

collaborators

8 papers

cs.DS20051 cited

Translating the EAH Data Compression Algorithm into Automata Theory

Dragos Trinca

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 symbo…

cs.DS2005

Modelling the EAH Data Compression Algorithm using Graph Theory

Dragos Trinca

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 […

cs.DS2005

Modelling the Eulerian Path Problem using a String Matching Framework

Dragos Trinca

The well-known Eulerian path problem can be solved in polynomial time (more exactly, there exists a linear time algorithm for this problem). In this paper, we model the problem usi…

cs.DS2005

High-performance BWT-based Encoders

Dragos Trinca

In 1994, Burrows and Wheeler developed a data compression algorithm which performs significantly better than Lempel-Ziv based algorithms. Since then, a lot of work has been done in…

cs.DS2005

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

Dragos Trinca

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…

cs.DS20053 cited

Adaptive Codes: A New Class of Non-standard Variable-length Codes

Dragos Trinca

We introduce a new class of non-standard variable-length codes, called adaptive codes. This class of codes associates a variable-length codeword to the symbol being encoded dependi…