Title :
Variable-to-fixed length codes for predictable sources
Author :
Savari, Serap A.
Author_Institution :
AT&T Bell Labs., Murray Hill, NJ, USA
fDate :
30 Mar-1 Apr 1998
Abstract :
A number of papers have investigated the compression obtained by some well-known lossless data compression algorithms in the limit as the dictionary size approaches infinity. Using a very detailed analysis of the Tunstall (1967) code as an example, we demonstrate that asymptotic analyses can fail to provide the performance of an algorithm in the important case of a predictable source with a small to moderate dictionary size
Keywords :
source coding; variable length codes; Tunstall code; asymptotic analysis; dictionary size limit; lossless data compression algorithms; predictable sources; redundancy analysis; variable-to-fixed length codes; Algorithm design and analysis; Binary codes; Data compression; Decoding; Dictionaries; Entropy; Failure analysis; Paper technology; Performance analysis; Performance loss;
Conference_Titel :
Data Compression Conference, 1998. DCC '98. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-8406-2
DOI :
10.1109/DCC.1998.672213
