DCC '01 Proceedings of the Data Compression Conference
IEEE Transactions on Information Theory
The structure of optimal prefix-free codes in restricted languages: the uniform probability case
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 754.90 |
Renewal theory is a powerful tool in the analysis of source codes. 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 (1977, 1978) codes and the Tunstall (1967) code. As a new application of our results, we provide the asymptotic performance of two of the Perl, Garey and Even (1975) prefix condition codes