Dictionary-based compression schemes provide fast decoding operation, typically at the
expense of reduced compression effectiveness compared to statistical or probability-based …

An entropy coder takes as input a sequence of symbol identifiers over some specified
alphabet and represents that sequence as a bitstring using as few bits as possible, typically …

Variable-to-fixed (VF) codes are often based on dictionaries that obey the prefix-free
property; eg, the Tunstall codes. However, correct VF codes need not be prefix free …

Marlin [1] is a Variable-to-Fixed (VF) codec optimized for decoding speed. To achieve its
speed, Marlin does not encode the current state of the input source, penalyzing compression …

Efficient high-throughput (HT) compression algorithms are paramount to meet the stringent
constraints of present and upcoming data storage, processing, and transmission systems. In …

This thesis concerns the design of compressed data structures for the efficient storage of
massive datasets of integer sequences and short strings. The studied problems arise in …

In modern days, wireless sensor networks and smart phones have been widely used in
various application domains including healthcare, environment, and intelligent building …

We introduce our research on compressed pattern matching technology that combines data
compression and pattern matching. To show the results of this work, we explain the collage …

The almost instantaneous variable-to-fixed (AIVF) code is a class of non-prefix codes that
parses data sequences into some fixed-length codewords. Recently, the dictionary …

Marlin is a Variable-to-Fixed (VF) codec optimized for high decoding speed through the use
of small sized dictionaries that fit in the L1 cache of most CPUs. While the size of Marlin …