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 …

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 …

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 …

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 …

Recent publications advocate the use of various variable length codes for which each
codeword consists of an integral number of bytes in compression applications using large …

It is paradoxical that, as the technology for storing and transmitting information has gotten
cheaper and more effective, interest in data compression has increased. There are many …

Most data that is inherently discrete needs to be compressed in such a way that it can be
recovered exactly, without any loss. Examples include text of all kinds, experimental results …

The emergence of the CD-ROM as a storage medium for full-text databases raises the
question of the maximum size database that can be contained by this medium. As an …

A new data structure is investigated, which allows fast decoding of texts encoded by
canonical Huffman codes. The storage requirements are much lower than for conventional …

This paper describes the design and implementation of a method for producing compact,
bytecoded instruction sets and interpreters for them. It accepts a grammar for programs …