### Аннотация

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 logm 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.

Язык оригинала | английский |
---|---|

Номер статьи | 116 |

Число страниц | 10 |

Журнал | Algorithms |

Том | 12 |

Номер выпуска | 6 |

DOI | |

Состояние | Опубликовано - 1 июн 2019 |

## Fingerprint Подробные сведения о темах исследования «Time-Universal data compression». Вместе они формируют уникальный семантический отпечаток (fingerprint).

## Цитировать

*Algorithms*,

*12*(6), [116]. https://doi.org/10.3390/a12060116