One-shot coding and repeated coding are considered for the class of almost instantaneous variable-to-fixed length (AIVF) codes, AIVF, which includes some nonproper VF codes in addition to the class of proper VF codes, PVF. An algorithm is given to construct the average-sense optimal (a-optimal) AIVF code in one-shot coding that attains the maximum average parse length in AIVF. The algorithm can...

In this paper the maximum length of binary Huuman codes is investigated dependent on the two lowest probabilities of encoded symbols. Furthermore, the structure of full binary trees with a given number of leaves, a limited depth, and maximum external path length is examined to get an improved upper bound on the external path length of Huuman trees.

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...

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...

In this paper we solve the following problem: Given a positive integer f and L weights (real numbers), nd a partition with f classes of the multiset of weights such that the sum of the costs of the optimum m-ary Hu man trees built for every class of is minimum. An application to the optimal extendibility problem for pre x codes is proposed.

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

In this paper, we propose a new compression technique based on transliteration of Bengali text to English. Compared to Bengali, English is a less symbolic language. Thus transliteration of Bengali text to English reduces the number of characters to be coded. Huffman coding is well known for producing optimal compression. When Huffman principal is applied on transliterated text significant perfo...

MP3 is the most widely used audio format nowadays in our daily life and music on the internet are often of this format. In order to seek commercial benefit, low bit rate MP3 audios are usually transcoded to high bit rate, resulting in fake-quality MP3 audios. Through analyzing the frequency statistics of Huffman table indexes, a method for detecting such fake-quality MP3 audios is presented in ...