Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.

The construction of optimal prefix codes plays a significant and influential role in applications concerning information processing and communication. For decades, different algorithms were proposed treating the issue of Huffman codes construction and various optimizations were introduced. In this paper we propose a detailed practical time-efficient parallel algorithm for generating Huffman cod...

We introduce a joint decoding algorithm for a Huffman source code followed by a convolutional channel code. The algorithm incorporates a restriction to valid Huffman codewords into the convolutional code’s trellis. Performance is improved by this restriction. Furthermore, soft Huffman decoding is implicitly included, and a priori probabilities of input symbols can be easily exploited, if availa...

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

Huffman coding is such a widespread method for creating prefix-free codes. Huffman code is used as a synonym for prefix-free code even when such a code is not produced by Huffman's algorithm. Huffman coding is an efficient source coding algorithm for source symbols that are not equally probable. It yields the smallest possible number of code symbols per source symbol [7]. In this paper, the Los...