Time-Universal Data Compression†
Institute of Computational Technologies of the Siberian Branch of the Russian Academy of Science, 630090 Novosibirsk, Russia
Department of Information Technologies, Novosibirsk State University, 630090 Novosibirsk, Russia
The preliminary version of this paper is accepted for ISIT 2019, Paris.
Received: 26 April 2019 / Revised: 25 May 2019 / Accepted: 27 May 2019 / Published: 29 May 2019
PDF [742 KB, uploaded 24 June 2019]
Nowadays, a variety of data-compressors (or archivers) is available, each of which has its merits, and it is impossible to single out the best ones. Thus, one faces the problem of choosing the best method to compress a given file, and this problem is more important the larger is the file. It seems natural to try all the compressors and then choose the one that gives the shortest compressed file, then transfer (or store) the index number of the best compressor (it requires
bits, if m
is the number of compressors available) and the compressed file. The only problem is the time, which essentially increases due to the need to compress the file m
times (in order to find the best compressor). We suggest a method of data compression whose performance is close to optimal, but for which the extra time needed is relatively small: the ratio of this extra time and the total time of calculation can be limited, in an asymptotic manner, by an arbitrary positive constant. In short, the main idea of the suggested approach is as follows: in order to find the best, try all the data compressors, but, when doing so, use for compression only a small part of the file. Then apply the best data compressors to the whole file. Note that there are many situations where it may be necessary to find the best data compressor out of a given set. In such a case, it is often done by comparing compressors empirically. One of the goals of this work is to turn such a selection process into a part of the data compression method, automating and optimizing it.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Ryabko, B. Time-Universal Data Compression. Algorithms 2019, 12, 116.
Ryabko B. Time-Universal Data Compression. Algorithms. 2019; 12(6):116.
Ryabko, Boris. 2019. "Time-Universal Data Compression." Algorithms 12, no. 6: 116.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.