Online prefix-free encoding algorithm

Authors:
Natthapon Punthong;Athasit Surarerks
Affiliations:
ELITE (Engineering Laboratory in Theoretical Enumerable System), Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University, Pathumwan, Bangkok, Thailand;ELITE (Engineering Laboratory in Theoretical Enumerable System), Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University, Pathumwan, Bangkok, Thailand
Venue:
SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
Year:
2006

Citing 9
Cited 0

Data compression with finite windows

Communications of the ACM
Prefix Codes: Equiprobable Words, Unequal Letter Costs

SIAM Journal on Computing
Huffman coding with unequal letter costs

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal Prefix-Free Codes that end in a Specified Pattern and Similar Problems: The Uniform Probability Case (Extended Abstract)

DCC '01 Proceedings of the Data Compression Conference
Algorithms for infinite huffman-codes

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The construction of codes for infinite sets

SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Existence of optimal prefix codes for infinite source alphabets

IEEE Transactions on Information Theory
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs

IEEE Transactions on Information Theory
A dynamic programming algorithm for constructing optimal “1”-ended binary prefix-free codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.