Abstract
Dynamic compression methods continuously update the model of the underlying text file to be compressed according to the already processed part of the file, assuming that such a model accurately predicts the distribution in the remaining part. Since this premise is not necessarily true, we suggest to update the model only selectively. We give empirical evidence that this hardly affects the compression efficiency, while it obviously may save processing time and allow the use of the compression scheme for cryptographic applications.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Prague Stringology Conference, PSC 2019 |
| Editors | Jan Holub, Jan Zdarek |
| Publisher | Prague Stringology Club |
| Pages | 102-110 |
| Number of pages | 9 |
| ISBN (Electronic) | 9788001066188 |
| State | Published - 2019 |
| Event | 23rd Prague Stringology Conference, PSC 2019 - Prague, Czech Republic Duration: 26 Aug 2019 → 28 Aug 2019 |
Publication series
| Name | Proceedings of the Prague Stringology Conference, PSC 2019 |
|---|
Conference
| Conference | 23rd Prague Stringology Conference, PSC 2019 |
|---|---|
| Country/Territory | Czech Republic |
| City | Prague |
| Period | 26/08/19 → 28/08/19 |
Bibliographical note
Publisher Copyright:© Proceedings of the Prague Stringology Conference, PSC 2019. All rights reserved.