Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
Breaking Substitution Cyphers Using Stochastic Automata
IEEE Transactions on Pattern Analysis and Machine Intelligence
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost
SIAM Journal on Computing
Self-Organizing Binary Search Trees
Journal of the ACM (JACM)
Alternatives to splay trees with O(log n) worst-case access times
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Self-adjusting trees in practice for large text collections
Software—Practice & Experience
Introduction to Information Theory and Data Compression
Introduction to Information Theory and Data Compression
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
Adaptive Structuring of Binary Search Trees Using Conditional Rotations
IEEE Transactions on Knowledge and Data Engineering
Self-Organizing Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Advances in data compression and pattern recognition
Advances in data compression and pattern recognition
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Universal coding of integers and unbounded search trees
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we show an effective way of using adaptive self-organizing data structures in enhancing compression schemes. We introduce a new data structure, the Partitioning Binary Search Tree (PBST), which is based on the well-known Binary Search Tree (BST), and when used in conjunction with Fano encoding, the PBST leads to the so-called Fano Binary Search Tree (FBST). The PBST and FBST can be maintained adaptively and in a self-organizing manner by using new tree-based operators, namely the Shift-To-Left (STL) and the Shift-To-Right (STR) operators. The encoding and decoding procedures that also update the FBST have been implemented, and show that the adaptive Fano coding using FBSTs, the Huffman, and the greedy adaptive Fano coding achieve similar compression ratios.