We contrast language modeling for binary response typing interfaces with the more standard use of language models for full sequence disambiguation in applications like speech recognition. We highlight a key issue for construction of these language models: using Huffman coding versus simpler binary coding tree topologies. We then introduce novel methods for handling of selection error within the...

In this paper, we studied the cascading of LZ variants to Huffman coding for multilingual documents. Two models are proposed: the static model and the adaptive (dynamic) model. The static model makes use of the dictionary generated by the LZW algorithm in the Chinese dictionary based Huffman compression to achieve better performance. The dynamic model is an extension of the static cascading mod...

Now-a-days power dissipation is a vital subject in elevated presentation digital routes, because the amount of transistors has increased significantly. Several methods have been planned to decrease the switching activity. This paper presents a new examination data compression technique based on a Huffman compression code that uses a viterbi decoder. Huffmann compression is used to compress the ...

Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are also discussed. Although the problem of existence of optimal synchronous codes has not been resolved yet, we show that any synchronous code can consider as an optimal synchronous code for some information source and that there always exist optimal synchronous codes for the i...

When the relative frequencies of characters vary significantly within a single file, it may be desirable to use a different Huffman code on different phases of the file. This note presents an heuristic algorithm for determining the boundaries between phases. l. Introduction Huffman encoding [3J is a well-known technique for data compression. The "standard" algorithm works off-line. Its first pa...

We determine some explicit expressions for the costs of Huffman trees with several classes of weight sequences.

Finally, our approach was heavily based on the use of Shannon-Fan0 codes, and not on the optimal Huffman codes. The problem is much more involved and challenging when Huffman codes are considered. Pioneering work on this difficult problem has been performed by Longo [ 181, [19], Nemetz and Simon [20], [21]. In the papers of Longo [ 181, [ 191 the informational divergence H(P IlQ) plays an impor...

Given a file T , and the Huffman encoding of its elements, we suggest using a pruning technique for Wavelet trees that enables direct access to the i-th element of T by reordering the bits of the compressed file and using some additional space. When compared to a traditional Wavelet tree for Huffman Codes, our different reordering of the bits usually requires less additional storage overhead by...

The paper deals with formal description of data transformation (compression and decompression process). We start by briefly reviewing basic concepts of data compression and introducing the model based approach that underlies most modern techniques. Then we present the arithmetic coding and Huffman coding for data compression, and finally see the performance of arithmetic coding. And conclude th...

In this paper we present online encoding and decoding algorithms for an infinite input alphabet. The well-known encoding algorithm that explicitly constructs the optimal codes is proposed by Huffman. This algorithm is clearly inappropriate for online encoding because the whole input data are not known before starting the process. We propose an algorithm that can be encoded while the input data ...