Journal of Algorithms
Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
Data compression: methods and theory
Data compression: methods and theory
An improved data structure for cumulative probability tables
Software—Practice & Experience
Introduction to data compression (2nd ed.)
Introduction to data compression (2nd ed.)
Introduction to Information Theory and Data Compression
Introduction to Information Theory and Data Compression
Discrete Mathematics and Its Applications
Discrete Mathematics and Its Applications
A Corpus for the Evaluation of Lossless Compression Algorithms
DCC '97 Proceedings of the Conference on Data Compression
DCC '02 Proceedings of the Data Compression Conference
Combining PPM Models Using A Text Mining Approach
DCC '01 Proceedings of the Data Compression Conference
Advances in data compression and pattern recognition
Advances in data compression and pattern recognition
A nearly-optimal Fano-based coding algorithm
Information Processing and Management: an International Journal
Grammar-based codes: a new class of universal lossless source codes
IEEE Transactions on Information Theory
Universal lossless source coding with the Burrows Wheeler transform
IEEE Transactions on Information Theory
A universal predictor based on pattern matching
IEEE Transactions on Information Theory
On the performance of recency-rank and block-sorting universal lossless data compression algorithms
IEEE Transactions on Information Theory
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
Variations on a theme by Huffman
IEEE Transactions on Information Theory
Information Processing Letters
An adaptive character wordlength algorithm for data compression
Computers & Mathematics with Applications
A novel lossless data compression scheme based on the error correcting Hamming codes
Computers & Mathematics with Applications
Fast decoding algorithms for variable-lengths codes
Information Sciences: an International Journal
Information Sciences: an International Journal
Hi-index | 0.07 |
Adaptive coding techniques have been increasingly used in lossless data compression. They are suitable for a wide range of applications, in which on-line compression is required, including communications, internet, e-mail, and e-commerce. In this paper, we present an adaptive Fano coding method applicable to binary and multi-symbol code alphabets. We introduce the corresponding partitioning procedure that deals with consecutive partitionings, and that possesses, what we have called, the nearly-equal-probability property, i.e. that satisfy the principles of Fano coding. To determine the optimal partitioning, we propose a brute-force algorithm that searches the entire space of all possible partitionings. We show that this algorithm operates in polynomial-time complexity on the size of the input alphabet, where the degree of the polynomial is given by the size of the output alphabet. As opposed to this, we also propose a greedy algorithm that quickly finds a sub-optimal, but accurate, consecutive partitioning. The empirical results on real-life benchmark data files demonstrate that our scheme compresses and decompresses faster than adaptive Huffman coding, while consuming less memory resources.