Journal of Algorithms
A locally adaptive data compression scheme
Communications of the ACM
The design and analysis of coalesced hashing
The design and analysis of coalesced hashing
Interval and recency rank source coding: two on-line adaptive variable-length schemes
IEEE Transactions on Information Theory
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
An honors course in data compression
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
An analysis of the information content of address reference streams
MICRO 24 Proceedings of the 24th annual international symposium on Microarchitecture
Is Huffman coding dead? (extended abstract)
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Algorithm 673: Dynamic Huffman coding
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Information Systems (TOIS)
An analysis of the Burrows-Wheeler transform
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of VLSI Signal Processing Systems
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Simple Bayesian Model for Bitmap Compression
Information Retrieval
Probabilistic optimization techniques for multicast key management
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network-Diffused Media Scaling for Multimedia Content Services
IDMS '99 Proceedings of the 6th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services
Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Handbook of massive data sets
Self-organized dynamic Huffman coding without frequency counts
DCC '95 Proceedings of the Conference on Data Compression
Low Delay Perceptually Lossless Coding of Audio Signals
DCC '01 Proceedings of the Data Compression Conference
Length-Restricted Coding in Static and Dynamic Frameworks
DCC '01 Proceedings of the Data Compression Conference
VPC3: a fast and effective trace-compression algorithm
Proceedings of the joint international conference on Measurement and modeling of computer systems
The VPC Trace-Compression Algorithms
IEEE Transactions on Computers
A novel approach for digital waveform compression
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
Information Processing Letters
An adaptive character wordlength algorithm for data compression
Computers & Mathematics with Applications
Feedback quantization for linear precoded spatial multiplexing
EURASIP Journal on Advances in Signal Processing
Switching code data compression technique using an Adaptive Huffman coding
MATH'08 Proceedings of the American Conference on Applied Mathematics
Fault-Tolerant Compression Algorithms for Delay-Sensitive Sensor Networks with Unreliable Links
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Dynamic asymmetric communication
Information Processing Letters
Worst-Case Optimal Adaptive Prefix Coding
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Stream-oriented lossless packet compression in wireless sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Text data compression algorithms
Algorithms and theory of computation handbook
A fast dynamic compression scheme for natural language texts
Computers & Mathematics with Applications
Area efficient VLSI architectures for Huffman coding
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
Evolution of human-competitive lossless compression algorithms with GP-zip2
Genetic Programming and Evolvable Machines
An automata approach to pattern collections
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Efficient adaptive data compression using fano binary search trees
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Trimming the tree: tailoring adaptive huffman coding to wireless sensor networks
EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks
A fast and efficient nearly-optimal adaptive Fano coding scheme
Information Sciences: an International Journal
Exact and approximation algorithms for error-detecting even codes
Theoretical Computer Science
The S-digraph optimization problem and the greedy algorithm
Discrete Optimization
Minimax trees in linear time with applications
European Journal of Combinatorics
On compressing data in wireless sensor networks for energy efficiency and real time delivery
Distributed and Parallel Databases
| Hi-index | 0.01 |
A new one-pass algorithm for constructing dynamic Huffman codes is introduced and analyzed. We also analyze the one-pass algorithm due to Faller, Gallager, and Knuth. In each algorithm, both the sender and the receiver maintain equivalent dynamically varying Huffman trees, and the coding is done in real time. We show that the number of bits used by the new algorithm to encode a message containing t letters is t bits more than that used by the conventional two-pass Huffman scheme, independent of the alphabet size. This is best possible in the worst case, for any one-pass Huffman method. Tight upper and lower bounds are derived. Empirical tests show that the encodings produced by the new algorithm are shorter than those of the other one-pass algorithm and, except for long messages, are shorter than those of the two-pass method. The new algorithm is well suited for on-line encoding/decoding in data networks and for tile compression.