The design and analysis of efficient lossless data compression systems
The design and analysis of efficient lossless data compression systems
Multialphabet Coding with Separate Alphabet Description
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Switching Between Two Universal Source Coding Algorithms
DCC '98 Proceedings of the Conference on Data Compression
On-line stochastic processes in data compression
On-line stochastic processes in data compression
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
Joint Matrix Universal Coding of Sequences of Independent Symbols
Problems of Information Transmission
A repetition based measure for verification of text collections and for text categorization
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
A comparison of set redundancy compression techniques
EURASIP Journal on Applied Signal Processing
Lossless compression of volumetric medical data
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
On compression-based text classification
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
| Hi-index | 0.00 |
For the PPM algorithm, we suggest new definitions of generalized frequencies of characters and “escapes.” This considerably increases the efficiency of lossless coding (compression) for various types of real-world discrete data.