V. Pougatchev (Jamaica)
Huffman Coding Algorithm, Binary Tree, InterpolationPolynomial, Orthogonal Polynomials.
The result of research described in this paper, concerns the possibility of implementation lossless Huffman compression information for files, where Huffman compression will not give an appropriate result where distribution of probabilities of occurrences of tokens is uniform or close to uniform. Using techniques as described in this paper it is possible to use the Huffman method in an improved way. An algorithm building binary trees for Huffman compression is developed further.
Important Links:
Go Back
