Data compression using static Huffman code-decode tables

Authors:
David R. McIntyre;Michael A. Pechura
Affiliations:
Cleveland State Univ., Cleveland, OH;-
Venue:
Communications of the ACM
Year:
1985

Citing 2
Cited 4

File archival techniques using data compression

Communications of the ACM
Data Types and Structures

Data Types and Structures

Data compression

ACM Computing Surveys (CSUR)
A benchmark suite for evaluating configurable computing systems—status, reflections, and future directions

FPGA '00 Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
SASE: implementation of a compressed text search engine

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Statistical modeling of huffman tables coding

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing

Quantified Score

Hi-index	48.22

Visualization

Abstract

Both static and dynamic Huffman coding techniques are applied to test data consisting of 530 source programs in four different languages. The results indicate that, for small files, a savings of 22-91 percent in compression can be achieved by using the static instead of dynamic techniques.