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 …

Over the last decade, arithmetic coding has emerged as an important compression tool. It is
now the method of choice for adaptive coding on myltisymbol alphabets because of its …

The MANTIS MultimodAl system for NeTworks of In-situ wireless Sensors provides a new
multithreaded cross-platform embedded operating system for wireless sensor networks. As …

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 …

Recent studies have shown that cache-conscious indexes such as the CSB+-tree
outperform conventional main memory indexes such as the T-tree. The key idea of these …

A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the
tendency of Huffman codes to resynchronize quickly, ie recovering after possible decoding …

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 …

We explore the use of compression methods to improve the middleware-based exchange of
information in interactive or collaborative distributed applications. In such applications, good …

Technological advancements in high throughput sequencing have led to a tremendous
increase in the amount of genomic data produced. With the cost being down to 2,000 USD …

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 …