N. Punthong and A. Surarerks (Thailand)
- Online encoding algorithm, prefix-free encoding, infinite Huffman codes, and recursive replacement method.
- The well-known Huffman encoding algorithm explicitly constructs the optimal codes. However, in the context of data communications, data encoded are usually online sent from one to another source. The Huffman algorithm is clearly inappropriate for online encoding because the whole data are not known before starting the process. In this paper, we present online prefix-free encoding and decoding algorithms. Theoretical result shows that the encoding tree obtained from the algorithm satisfies the code length property of an optimal solution. Experimental results showed that the obtained average code length is close to the one resulted from Huffman algorithm and the entropy of input data.
Important Links:
Go Back
