Lossless data compression via substring enumeration

Abstract: We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order.
Abstract: We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order.
The substrings are enumerated from the shortest to the longest and in lexicographic order. Compression is obtained from the fact that the set of the substrings of a particular length gives a lot of information about the substrings that are one bit longer.
Compression via Substring Enumeration (CSE) is a lossless universal data compression scheme, introduced by Dube and Beaudoin. CSE compresses a target binary string by enumerating substrings occurred in it, and encodes the numbers of occurrences effectively, by calculating its upper-bound and lower-bound based on the previous numbers.

Categories

Data compression and visualization
Data compression with machine learning
Data compression wikipedia
Data compression with neural networks
Data compression with deep probabilistic models
Data compression wizard
Data compression worksheet
Data compression with finite windows
Data compression what is it
Data compression web browser
Data compression with examples
Data compression websocket
Data compression works on
Data compression wav
Data compression what is it used for
Data compression with quantum
Data compression xz
Data compression format xz
Xor data compression
Xilinx data compression