ACM

Communications of the ACM

Home/Magazine Archive/June 1985 (Vol. 28, No. 6)/Data compression using static Huffman code-decode.../Abstract

Data compression using static Huffman code-decode tables

By David R. McIntyre, Michael A. Pechura
Communications of the ACM, June 1985, Vol. 28 No. 6, Pages 612-616
10.1145/3812.3815
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.