Name
Abstract | ||
|---|---|---|
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, designed variable-to-fixed length codes for memoryless sources that are optimal under certain constraints. In this paper, we study the Tunstall and Khodak codes using variety of techniques ranging from stopping times for sums of independent random variables to Tauberian theorems and Mellin transform. After proposing an algebraic characterization of the Tunstall and Khodak codes, we present new results on the variance and a central limit theorem for dictionary phrase lengths. This analysis also provides a new argument for obtaining asymptotic results about the mean dictionary phrase length and average redundancy rates. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/TIT.2010.2046248 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
algebra,random processes,transforms,variable length codes,Khodak variation,Mellin transform,Tauberian theorem,Tunstall code,algebraic characterization,average redundancy rate,dictionary phrase length,random walk,variable-to-fixed length encoder,Analytic information theory,Mellin transform,Tauberian theorems,Tunstall code,renewal theory,stopping time,variable-to-fixed length codes | Abelian and tauberian theorems,Information theory,Mellin transform,Discrete mathematics,Central limit theorem,Random variable,Combinatorics,Random walk,Stopping time,Mathematics,Variable-length code | Journal |
Volume | Issue | ISSN |
56 | 6 | 0018-9448 |
Citations | PageRank | References |
6 | 0.56 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Drmota | 1 | 438 | 54.46 |
| yuriy a reznik | 2 | 258 | 25.70 |
| Wojciech Szpankowski | 3 | 1557 | 192.33 |