A probabilistic approach to some asymptotics in noiseless communication Academic Article

abstract

• Renewal theory is a powerful tool in the analysis of source codes. In this paper, we use renewal theory to obtain some asymptotic properties of finite-state noiseless channels. We discuss the relationship between these results and earlier uses of renewal theory to analyze the Lempel-Ziv codes and the Tunstall code. As a new application of our results, we provide the asymptotic performance of two of the Perl, Garey, and Even prefix condition codes. 2000 IEEE Publisher Item Identifier S 0018-9448(00)04279-6.

authors

• Savari, Serap

published proceedings

• IEEE TRANSACTIONS ON INFORMATION THEORY

author list (cited authors)

• Savari, S. A.

citation count

• 14

complete list of authors

• Savari, SA

publication date

• January 2000

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Finite-state Noiseless Channels
• Lopsided Trees
• Recurrences
• Renewal Theory

Digital Object Identifier (DOI)

• 10.1109/18.850666

start page

• 1246

end page

• 1262

volume

• 46

issue

• 4

URL

• http://dx.doi.org/10.1109/18.850666