DocumentCode
2478448
Title
Predictable sources and renewal theory
Author
Savari, Serap A.
Author_Institution
Lucent Technol., AT&T Bell Labs., Murray Hill, NJ, USA
fYear
1998
fDate
16-21 Aug 1998
Firstpage
315
Abstract
Renewal theory is a powerful tool in the asymptotic analysis of source codes. We investigate its limitations in answering fundamental questions about predictable, binary memoryless sources. We show that for this class of sources the redundancy of a Tunstall code with a small to moderate dictionary size is considerably smaller than suggested by an exact asymptotic analysis of the code
Keywords
memoryless systems; redundancy; source coding; Tunstall code; asymptotic analysis; binary memoryless sources; dictionary size; predictable sources; redundancy; renewal theory; source codes; Convergence; Dictionaries; Equations;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708920
Filename
708920
Link To Document