Huffman's algorithm for computing minimum-redundancy prefix-free codes has almost
legendary status in the computing disciplines. Its elegant blend of simplicity and applicability …

The exponential growth of computer applications in the last three decades of the 20th
century has resulted in an explosive growth in the amounts of data moved between …

SPEC CPU2006 Benchmark Descriptions Page 1 SPEC CPU2006 Benchmark Descriptions
Descriptions written by the SPEC CPU Subcommittee and by the original program authors [1] …

This paper surveys the theoretical literature on fixed-to-variable-length lossless source code
trees, called code trees, and on variable-length-to-fixed lossless source code trees, called …

We present a fast compression technique for natural language texts. The novelties are that
(1) decompression of arbitrary portions of the text can be done very efficiently,(2) exact …

An authoritative reference to the whole area of source coding algorithms, Compression and
Coding Algorithms will be a primary resource for both researchers and software engineers …

We describe the techniques developed to gather and distribute in a highly compressed, yet
accessible, form a series of twelve snapshot of the. uk web domain. Ad hoc compression …

Several measures are defined and investigated, which allow the comparison of codes as to
their robustness against errors. Then new universal and complete sequences of variable …

Genomic repositories increasingly include individual as well as reference sequences, which
tend to share long identical and near-identical strings of nucleotides. However, the …

Minimum redundancy coding (also known as Huffman coding) is one of the enduring
techniques of data compression. Many efforts have been made to improve the efficiency of …