Sorry, you need to enable JavaScript to visit this website.

Reverse Multi-Delimiter Compression Codes

Primary tabs

Citation Author(s):
Anatoly Anisimov
Submitted by:
Igor Zavadskyi
Last updated:
29 March 2020 - 4:53am
Document Type:
Presentation Slides
Document Year:
Presenters Name:
Igor Zavadskyi



An enhanced version of a recently introduced family of variable length binary codes with multiple pattern delimiters is presented and discussed. These codes are complete, universal, synchronizable, they have monotonic indexing and allow a standard search in compressed files. Comparing the compression rate on natural language texts demonstrates that introduced codes appear to be much superior to other known codes with similar properties. A fast byte-aligned decoding algorithm is constructed, which operates much faster than the one for Fibonacci codes.

0 users have voted:

Dataset Files