We present a semi-formal derivation of Hu:ffman's well-known algorithm for the construction of an optimal encoding tree.

This paper addresses the problem of speeding up string matching by text compression, and presents a compressed pattern matching (CPM) algorithm which finds a pattern within a text given as a collage system 〈D,S〉 such that variable sequence S is encoded by byte-oriented Huffman coding. The compression ratio is high compared with existing CPM algorithms addressing the problem, and the search time...

A canonical Huffman code is an optimal prefix-free compression whose codewords enumerated in the lexicographical order form a list of binary words non-decreasing lengths. Gagie et al. (2015) gave representation this coding capable encoding and decoding symbol constant worst-case time. It uses σlg⁡ℓmax+o(σ)+O(ℓmax2) bits space, where σ ℓmax are alphabet size maximum codeword length, respectively...

BACKGROUND The hooks of the acanthocephalan proboscis exhibit serial variation in size and shape. The Meristogram was developed by Huffman and Bullock (1975) to provide a graphical representation of this positional variation in hook morphology. Initial studies demonstrated the ability of the Meristogram to discriminate species within the genera Echinorhynchus and Pomphorhynchus (Huffman and Bul...

It is known that LOG – EXP transform based image compression algorithm proposed by S.C.Huang, L.G.Chen and H.C.Chang offers high Compression Ratio (CR) and high image quality compared to JPEG for any specified value of Peak-Signal to Noise Ratio (PSNR). In this paper, a modified LOG – EXP transform based image compression algorithm obtained by using arithmetic coding in the place of Huffman cod...