Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Data compression using static Huffman code-decode tables

Data compression using static Huffman code-decode tables 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Data compression using static Huffman code-decode tables

Download PDF
5 pages

Loading next page...
 
/lp/association-for-computing-machinery/data-compression-using-static-huffman-code-decode-tables-2OSjl01iew

References (4)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1985 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/3812.3815
Publisher site
See Article on Publisher Site

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.

Journal

Communications of the ACM – Association for Computing Machinery

Published: Jun 1, 1985

There are no references for this article.