Predictable sources and renewal theory Conference Paper

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. 1998 IEEE.

name of conference

• Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

authors

• Savari, Serap

published proceedings

• 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS

author list (cited authors)

• Savari, S. A.

citation count

• 2

complete list of authors

• Savari, SA

publication date

• January 1998

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

keywords

• 49 Mathematical Sciences
• 4905 Statistics

Digital Object Identifier (DOI)

• 10.1109/ISIT.1998.708920

International Standard Book Number (ISBN) 10

• 0-7803-5000-6

International Standard Book Number (ISBN) 13

• 9780780350007

start page

• 315

end page

• 315

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fisit.1998.708920