Journal of Algorithms
Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Real-time software-based video coder for multimedia communication systems
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
RLH: bitmap compression technique based on run-length and huffman encoding
Proceedings of the ACM tenth international workshop on Data warehousing and OLAP
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
RLH: Bitmap compression technique based on run-length and Huffman encoding
Information Systems
A web search engine model based on index-query bit-level compression
Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications
ODC: Frame for definition of Dense codes
European Journal of Combinatorics
| Hi-index | 0.00 |
We present a Pascal implementation of the one-pass algorithm for constructing dynamic Huffman codes that is described and analyzed in a companion paper. The program runs in real time; that is, the processing time for each letter of the message is proportional to the length of its codeword. The number of bits used to encode a message of t letters is less than t bits more than that used by the well-known two-pass algorithm. This is best possible for any one-pass Huffman scheme. In practice, it uses fewer bits than all other Huffman schemes. The algorithm has applications in file compression and network transmission.