Data compression using static Huffman code-decode tables

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. © 1985, ACM. All rights reserved.