The issue of robust and joint source-channel decoding of quasi-arithmetic codes is addressed. Quasi-arithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This amounts to approximating the distribution of the source. The approximation of the source distribution leads to the introduction of redundancy that can be exploited for robust decoding in presence of ...

The final coder in Burrows-Wheeler compression is usually either an adaptive Huffman coder (for speed) or a complex of arithmetic coders for better compression. This article describes the use of conventional pre-defined variable length codes or universal codes and shows that they too can give excellent compression. The paper also describes a “sticky Move-to-Front” modification which gives a use...

In this paper, complementary Huffman coding techniques are proposed for test data compression/decompression of complex SOC designs during manufacturing testing. Instead of the compatible relationship between test data blocks, complementary features between test blocks are also exploited. Based on this property, more test data blocks can share the same codeword and the size of the modified Huffm...

Compression is a technique to reduce the quantity of data without excessively reducing the quality of the multimedia data.The transition and storing of compressed multimedia data is much faster and more efficient than original uncompressed multimedia data. There are various techniques and standards for multimedia data compression, especially for image compression such as the JPEG and JPEG2000 s...

A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly, i.e. recovering after possible decoding errors, in most cases. The average number of bits that have to be processed until synchronization is analyzed and shows good agreement with empirical data. As Huffman coding is also a part of the JPEG image compr...

This paper describes recent work on the T-Codes, which are a new class of variable length codes with superlative selfsynchronizing properties. The T-Code construction algorithm i s outlined, and it is shown that in situations where codeword synchronization is important the T-Codes can be used instead of Huffman codes, giving excellent self-synchronizing properties without sacrificing coding eff...

One well-known loss-less image technique is DCT-based JPEG compression that is quite effective at low or moderate compression ratios, up to ratios of 20 or 25 to 1. Beyond this point, the image becomes very “blocky” as the compression increases and the image quality becomes too poor for practical use. Another drawback of JPEG compression is its resolution dependence. In order to “zoom-in” on a ...

Algoritme Huffman dan Weaven-Hankamer adalah dua algoritme pengodean sumber yang diterapkan secara umum untuk teks. Kedua ini membutuhkan lebih banyak waktu menyelesaikan prosesnya karena memiliki tahapan. Oleh itu, penelitian bertujuan membuat user interface menggunakan MATLAB dapat menyimulasikan proses kedua mampu memberikan hasil sangat akurat dengan cepat. Ada skenario pada ini. Terdapat d...

Although a distributed index on a distributed hash table (DHT) enables efficient document query processing in Peer-to-Peer information retrieval (P2P IR), the index costs a lot to construct and it tends to be an unfair management because of the unbalanced term frequency distribution. We devised a new distributed index, named Huffman-DHT, for P2P IR. The new index uses an algorithm similar to Hu...

3 Probability Coding 10 3.1 Prefix Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.1.1 Relationship to Entropy . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2 Huffman Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2.1 Combining Messages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2.2 Minim...