On the temporal HZY compression scheme
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Augmenting Suffix Trees, with Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
| Hi-index | 754.84 |
Nonasymptotic coding and converse theorems are derived for universal data compression algorithms in cases where the training sequence (“history”) that is available to the encoder consists of the most recent segment of the input data string that has been processed, but is not large enough so as to yield the ultimate compression, namely, the entropy of the source