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.
[1] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.
[2] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[3] Leo R. Gotlieb,et al. Data types and structures , 1978 .
[4] Michael A. Pechura,et al. File archival techniques using data compression , 1982, CACM.