without Frequency Counts Yoshiyuki Okada, Noriko Satoh, Kimitaka Murashita, and Shigeru Yoshida Holography and Color Imaging Lab., Fujitsu Laboratories Ltd. Email: (yokada,nsatoh,kimi,per241)@flab.fujitsu.co.jp

We describe the implementation of a data compression scheme as an integral and transparent layer within a full-text retrieval system. Using a semi-static word-based compression model, the space needed to store the text is under 30% of the original requirement. The model is used in conjunction with canonical Huffman coding, and together these two paradigms provide fast decompression. Experiments...

The development of an efficient compression scheme to process the Arabic language represents a difficult task. This paper employs the dynamic Huffman coding on data compression with variable length bit coding, on the Arabic language. Experimental tests have been performed on both Arabic and English text. A comparison is made to measure the efficiency of compressing data results on both Arabic a...

Article history: Received 26 February 2009 Revised 21 September 2009 Available online 2 February 2010 Communicated by W. Cary Huffman

We will show that • the entropy for a random variable gives a lower bound on the number of bits needed per character for a binary coding • Huffman codes are optimal in the average number of bits used per character among binary codes • the average bits per character used by Huffman codes is close to the entropy of the underlying random variable • one can get arbitrarily close to the entropy of a...

Codes may be characterized by how general they are with respect to the distribution of symbols they are meant to code. Universal coding techniques assume only a nonincreasing distribution. Golomb coding assumes a geometric distribution [1]. Fiala and Greene’s (start, step, stop) codes assume a piecewise uniform distribution function with each part distributed exponentially [2]. Huffman codes ar...

A simple parallel algorithm for decoding a Huuman encoded le is presented , exploiting the tendency of Huuman codes to resynchronize quickly in most cases. An extention to JPEG decoding is mentioned.

A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus its depth. Golumbic (1976) introduced minimax trees and gave a Huffman-like, O(n log n)-time algorithm for building them. Drmota and Szpankowski (2002) gave another O(n log n)-time algorithm, which takes linear time when th...

Given a probability vector, Huffman coding finds a corresponding prefix-free binary code that minimizes the mean codeword length. In this paper we explore situations in which the goals are different from those in Huffman coding. We explore a family of penalties (generalized means) proposed by Campbell [8], finding redundancy bounds for a common subfamily. We generalize an efficient algorithm fo...